#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector <long long> snuke;

int main() {

  long long n;
  cin >> n;
  for(long long i = 1;i * i <= n;i++){
    if(n % i == 0 && i * i != n){
      snuke.push_back(i);
      snuke.push_back(n / i);
    }else if(i * i == n){
      snuke.push_back(i);
    }
  }

  sort(snuke.begin(),snuke.end());
  for(int i = 0;i < snuke.size();i++){
    cout << snuke[i] << '\n';
  }
  return 0;
}

#include<bits/stdc++.h>
#define            pb            push_back
#define            pl            pair<ll,ll>
#define            pll           pair<ll,pair<ll,ll>>
#define            ll            long long
#define            vl            vector<ll>
#define            fastio        ios_base::sync_with_stdio(false); cin.tie(NULL);
#define            mp            make_pair
#define            w(t)          int t;cin>>t;while(t--)
#define            inf           1e18
#define            fi(a,n)       for(ll i=a;i<n;i++)
#define            fr(i,a,b)     for(ll i=a;i>=b;i--)
#define            fj(a,n)       for(ll j=a;j<n;j++)
#define            k(a,n)        for(ll k=a;k<n;k++)
#define            endl          "\n"
#define            all(v)        (v).begin(),(v).end()
#define            set1(x)       __builtin_popcount(x)
#define            gcd(a,b)      __gcd(a,b)
#define mem1(a)           memset(a,-1,sizeof(a))
#define mem0(a)           memset(a,0,sizeof(a))
using namespace std;
const ll mod= 1000000007;
const ll N =1000005;
void solve()
{
    ll n;
    cin>>n;
    cout<<100-(n%100)<<endl;
}
int main()
{
	ios_base::sync_with_stdio(false);
    cin.tie(NULL);
	#ifndef ONLINE_JUDGE
    // for getting input from input.txt
    freopen("input.txt", "r", stdin);
    // for writing output to output.txt
    freopen("output.txt", "w", stdout);
#endif
     // w(t)
    	solve();

}