n=int(input())
if n>=0 and n<=9:
print(1)
else:
s=str(n)
k=(int(s[0])+1)*(10**(len(s)-1))
print(k-n)#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main(){
ll int d=0;
string s; cin>>s;
if(s.length()==1) cout<<1<<endl;
else{
int l=s.length(); d=s[0]-'0';
for(int i=1; i<l; i++){
d= (d*10) + (s[i]-'0');
}
// cout<<d+100-d<<endl;
int a=s[0]-'0'+1;
a=a*pow(10, l-1);
cout<<a-d<<endl;
}
return 0;
}198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |
174. Dungeon Game | 127. Word Ladder |