CF#808 A. Lucky Year（水题）

A. Lucky Year

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Apart from having lots of holidays throughout the year, residents of Berland also have whole lucky years. Year is considered lucky if it has no more than 1 non-zero digit in its number. So years 100, 40000, 5 are lucky and 12, 3001 and 12345 are not.

You are given current year in Berland. Your task is to find how long will residents of Berland wait till the next lucky year.

Input

The first line contains integer number n (1 ≤ n ≤ 109) — current year in Berland.

Output

Output amount of years from the current year to the next lucky one.

Examples

input

4

output

1

input

201

output

99

input

4000

output

1000

Note

In the first example next lucky year is 5. In the second one — 300. In the third — 5000.

题意：给出一个 n ，找出一个大于 n 且只有一位非0数字的数 m，并使 m 尽量小，求 m - n。

#include<bits/stdc++.h>
using namespace std;

int Pow(int n){
    int res = 1;
    for(int i = 1; i < n; i++){
        res *= 10;
    }
    return res;
}

int main()
{
    char a[10];
    while(~scanf("%s", a)){
        int l = strlen(a);
        if(l == 1) printf("1\n");
        else{
            int x = atoi(a);
            printf("%d\n", Pow(l)*(a[0]-'0'+1)-x);
        }
    }
}