Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Lucky Year

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputApart 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* ≤ 10^{9}) — 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.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 04:28:08 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|