#include<bits/stdc++.h>

using namespace std;
 
// Competetive Template:
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
typedef pair <lli,lli> pll;
typedef pair <lli,string> pls;
typedef pair <lli,lli> pll;

typedef vector <lli> vl;
typedef vector <pll> vll;
typedef vector <string> vs;
typedef vector <char> vc;

typedef set <lli> sl;

typedef map <lli, lli> mll;
typedef map <pll, lli> mpll;
typedef map <string, lli> msl;

typedef priority_queue <lli> max_heap ;
typedef priority_queue < lli, vector<lli> , greater<lli> > min_heap;

// Debugging :
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
 
#define pb push_back 
#define pf push_front
#define in insert 
#define popb pop_back
#define popf pop_front
#define ba  back
#define si size()
#define be begin()
#define en end()
#define le length()
#define lb lower_bound
#define mp make_pair 
#define mt make_tuple
#define fi first
#define se second
#define deb debug
#define all(v) v.be, v.en
#define INF LLONG_MAX
const ldb PI = acos(-1.0);

#define forz(i, n) for (int i = 0; i < n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)

#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rfore(i, m, n) for (int i = n; i >= m; i--)

#define deci(n)  fixed<<setprecision(n)
#define high(n) __builtin_popcount(n)
#define parity(n) __builtin_parity(n)
#define ctz(n)  __builtin_ctz(n)
#define mod 1000000007
#define mod2 998244353

// Printing Data :
#define pvec(v) forz(i,v.si) cout<<v[i]<<" "; cout<<endl;
#define parr(arr, n) forz(i,n) cout<<arr[i]<<" "; cout<<endl;

#define p1(i) cout<<i<<endl
#define p2(i, j) cout<<i<<" "<<j<<endl
#define p3(i, j, k) cout<<i<<" "<<j<<" "<<k<<endl
#define p4(i, j, k, l) cout<<i<<" "<<j<<" "<<k<<" "<<l<<endl

// Exponentiation in O(log y)
lli power(lli x,lli y){lli res=1; x=x;while(y>0){if(y&1) res=(res*x);y=y>>1;x=(x*x);}return res;} 

// Modular Exponentiation in O(log y)
lli power(lli x,lli y,lli p){lli res=1; x=x%p;while(y>0){if(y&1) res=(res*x)%p;y=y>>1;x=(x*x)%p;}return res;} 

// Euclidean gcd
lli gcd(lli a, lli b) { if (a==0) return b; return gcd(b % a, a);}

// Primality Test
bool isPrime(lli n)
{
    if(n==2) return true;
    if(n%2==0) return false;
    for(lli i=3; i<=sqrt(n); i+=2)
    if(n%i==0) return false;
    return true;
}

lli lowerIndex(vector <lli> &arr, lli x) 
{ 
    lli n = arr.si;
    lli l = 0, h = n - 1; 
    while (l <= h) { 
        lli mid = (l + h) / 2; 
        if (arr[mid] >= x) 
            h = mid - 1; 
        else
            l = mid + 1; 
    } 
    return l; 
} 
  
lli upperIndex(vector <lli> &arr, lli y) 
{ 
    lli n = arr.si;
    lli l = 0, h = n - 1; 
    while (l <= h) { 
        lli mid = (l + h) / 2; 
        if (arr[mid] <= y) 
            l = mid + 1; 
        else
            h = mid - 1; 
    } 
    return h; 
} 
  
lli countInRange(vector <lli> &arr, lli x, lli y) 
{ 
    lli n = arr.si;
    lli count = 0; 
    count = upperIndex(arr, y) - lowerIndex(arr, x) +1; 
    return count; 
}

bool isPalindrome(string str) 
{ 
    lli l = 0, h = str.le - 1; 
    while (h > l) if (str[l++] != str[h--]) return false; 
    return true;
} 

// Returns true if s1 is substring of s2 
bool isSubstring(string s1, string s2) 
{ 
    int M = s1.length(); 
    int N = s2.length(); 
  
    /* A loop to slide pat[] one by one */
    for (int i = 0; i <= N - M; i++) { 
        int j; 
  
        /* For current index i, check for pattern match */
        for (j = 0; j < M; j++) 
            if (s2[i + j] != s1[j]) 
                break; 
  
        if (j == M) 
            return true; 
    } 
  
    return false; 
}

// Returns a vector consisiting of all divisors of n.
vector <lli>  getDivisors(lli n) 
{ 
    vector<lli> v; 
    for (lli i=1; i<=sqrt(n); i++) 
    { 
        if (n%i==0) 
        { 
            if (n/i == i) 
                v.pb(i);
            else
            { 
                v.pb(i);
                v.push_back(n/i); 
            } 
        } 
    } 

    sort(v.be, v.en);
    return v;
}

// Returns a vector consisting of all prime factors of n.
vector <lli> primeFactors(lli n)  
{  
    vector <lli> v;
    while (n % 2 == 0)  
    {  
        v.pb(2);
        n = n/2;  
    }  
  
    for (lli i = 3; i <= sqrt(n); i = i + 2)  
    {  
        while (n % i == 0)  
        {  
            v.pb(i);
            n = n/i;  
        }  
    }  
  
    if (n > 2)  
        v.pb(n);

    return v;
} 


// update(l, r, x) : Adds x to all values from A[l] to A[r] (both inclusive).
// printArray() : Prints the current modified array.
vl initializeDiffArray(vl & A) 
{ 
    lli n = A.size(); 
  
    vl D(n + 1); 
  
    D[0] = A[0], D[n] = 0; 
    for (int i = 1; i < n; i++) 
        D[i] = A[i] - A[i - 1]; 
    return D; 
} 
  
// Does range update 
// Updates all i in the range (l, r) : a[i] += x.
void update(vl & D, lli l, lli r, lli x) 
{ 
    D[l] += x; 
    D[r + 1] -= x; 
} 
  
// Prints updated Array 
void getArray(vl & A, vl & D) 
{ 
    for (int i = 0; i < A.size(); i++) { 
        if (i == 0) 
            A[i] = D[i]; 
  
        else
            A[i] = D[i] + A[i - 1]; 
    }  
} 


// CODE BEGINS :
int main()
{
	ios::sync_with_stdio(0), cin.tie(0),cout.tie(0);

    lli n; cin>>n;
    if(n%1000!=0)
    p1(1000-n%1000);

    else
    p1(0);
    
    return 0;
}
























































Measured memory_bytes: 3672