#include <bits/stdc++.h>
using namespace std;
#define  w(t)                      int t;  cin>>t;  while(t--)
#define  mod1                      1000000007
#define  mod2                      998244353
#define  ll                        long long int
#define  ull                       unsigned long long int
#define  fastIO                    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define  vll                       vector<ll>
#define  vi                        vector<int>
#define  vch                       vector<char>
#define  pll                       pair<ll,ll>
#define  pii                       pair<int,int>
#define  makpii                    make_pair
#define  mpii                      unordered_map<int,int>
#define  sti                       unordered_set<int>
#define  mpci                      unordered_map<char,int>
template<typename T>
T myMax(T x, T y)
{
	return (x > y) ? x : y;
}
struct myComp1          //      sort pairs by second element (MAX)
{
	constexpr bool operator()
	(pair<ll, ll> const& a, pair<ll, ll> const& b)const noexcept
	{
		return a.second < b.second;
	}
};
struct myComp2          //      sort pairs by second element (MIN)
{
	constexpr bool operator()
	(pair<ll, ll> const& a, pair<ll, ll> const& b)const noexcept
	{
		return a.second > b.second;
	}
};
priority_queue<pll, vector<pll>, myComp1> p1; // priority queue with second element in MAX order
priority_queue<pll, vector<pll>, myComp2> p2; // priority queue with second element in MIN order
int32_t main()
{
	fastIO
#ifndef ONLINE_JUDGE
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
#endif
	int x;
	cin >> x;
	if (x % 100 == 0)
	{
		cout << 100 << "\n";
	}
	else
	{
		int val = x;
		while (val % 100 != 0)
		{
			val++;
		}
		cout << val - x << "\n";
	}
	return 0;
}
/*bool prime[1000001];
int primebeh[1000001];
int primesnear[1000001];
void sieve()
{
	int n = 1000000;
	memset(prime, true, sizeof(prime));
	for (int p = 2; p * p <= n; p++)
	{
		if (prime[p] == true)
		{
			for (int i = p * p; i <= n; i += p)
				prime[i] = false;
		}
	}
	int last = 0;
	for (int i = 2; i <= n; i++)
	{
		if (prime[i])
		{
			primesnear[i] = i;
			last = i;
		}
		else
		{
			primesnear[i] = last;
		}
	}
	last = 0;
	for (int i = n; i >= 2; i--)
	{
		if (prime[i])
		{
			primebeh[i] = i;
			last = i;
		}
		else
		{
			primebeh[i] = last;
		}
	}
ll power(ll x, ll y, ll p)
{
	ll res = 1; x = x % p; while (y > 0) {if (y & 1) {res = (res * x) % p;} y = y >> 1; x = (x * x) % p;}
	return res;
}
ll modInverse(ll n, int p)
{
	return power(n, p - 2, p);
}
ll nCrModPFermat(ll n, ll r, ll p)
{
	if (n < r)
		return 0;
	if (r == 0)
		return 1;
	ll fac[n + 1];
	fac[0] = 1;
	for (int i = 1; i <= 1000; i++)
		fac[i] = (fac[i - 1] * i) % mod2;
	return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) % p;
}
}*/
/*
 *  Created on: 20 / 2 / 2021
 *  Author:     Eslam Waheed
 */

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

clock_t T;
#define ctime         cerr << "Time : " << double(clock() - T) / CLOCKS_PER_SEC << '\n'
#define Eslam__Waheed ios_base::sync_with_stdio(false);cout.tie(NULL);cin.tie(NULL);

#define ll   long long
#define ull  unsigned ll
#define ld   long double

#define all(c)  c.begin(), c.end()
#define rall(c) c.rbegin(), c.rend()
#define stp(n)  cout << fixed << setprecision(n);
#define iq(v)   v.resize(unique(v.begin(),v.end())-v.begin())
#define sz(s)   (ll)s.size()
#define endl    '\n'

/*
int dx[] = { 1,0,-1,0 };
int dy[] = { 0,1,0,-1 };
*/
//const ld PI = acos(-1);
//ll gcd(ll a, ll b) { return !b ? abs(a) : gcd(b, a % b); }

// ( إن الله وملائكته يصلون على النبي يا أيها الذين آمنوا صلوا عليه وسلموا تسليما )

int main()
{
	//stp(0)
	Eslam__Waheed;
	ll n; cin >> n;
	ll x = n % 100;
	cout << 100 - x;
}