Codeforces Round #427 (Div. 2)B. The number on the board

B. The number on the board

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 ≤ 109).

The second line contains integer n (1 ≤ n < 10100000).

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.

Examples

input

3
11

output

1

input

3
99

output

0

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.

题意:k表示一个数的每一位上的数之和，再给你一个数问要改变多少次才能每个数上之和不少于k。

题解:首先判断该数每个数上的之和是否大于等于k，如果是输出0，否则贪心，把最小那位数改成9。

#include <algorithm>
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <cstdio>
using namespace std;
#define INF 0x3f3f3f3f
#define N 200000
char s[N];
int a[N];
int main()
{
    int n;
    int sum = 0, len;
    long long ans = 0;
    scanf("%d%s", &n, s);
    len = strlen(s);
    for(int i = 0; i < len; i++) {
        ans += (s[i] - '0');
        a[i] = (s[i] - '0');
    }
    if(ans >= n) {
        printf("0\n");
    }
    else {
        sort(a, a + len);
        for(int i = 0; i < len; i++) {
            ans += (9 - a[i]);
            sum++;
            if(ans >= n)
                break;
        }
        printf("%d\n", sum);
    }
    return 0;
}