Some natural number was written on the board. Its sum of digits was not less than k. But you were distracted a bit, and someone changed this number to n, replacing some digits with others. It's known that the length of the number didn't change.

You have to find the minimum number of digits in which these two numbers can differ.

Input

The first line contains integer k (1 ≤ k ≤ 10⁹).

The second line contains integer n (1 ≤ n < 10¹⁰⁰⁰⁰⁰).

There are no leading zeros in n. It's guaranteed that this situation is possible.

Output

Print the minimum number of digits in which the initial number and n can differ.

Note

In the first example, the initial number could be 12.

In the second example the sum of the digits of n is not less than k. The initial number could be equal to n.

#include <stdio.h>

#include <stdlib.h>

#include <cmath>

#include <string.h>

#include <iostream>

#include<algorithm>

#include <queue>

#include <vector>

#include <cmath>

#include<string>

#define inf 0x3f3f3f3f

using namespace std;

const int maxn=1e5+;

#define lrt (rt*2)

#define rrt  (rt*2+1)

#define LL long long

#define inf 0x3f3f3f3f

#define pi acos(-1.0)

#define exp 1e-8

#define For(i,n)  for(int i=0;i<n;i++)

//************************************************63

char a[maxn];

LL b[maxn];

int main()

{

    LL n,sum=,k=,ans=;

    scanf("%I64d %s",&n,a);

    for(LL i=;a[i]!='\0';i++)

    {

        b[k]=a[i]-'';

        sum+=b[k];

        k++;

    }

    sort(b,b+k);

    while(sum<n)

    {

        sum+=(-b[ans]);

        ans++;

    }

    cout<<ans<<endl;

    return ;

}