#include //ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; typedef long long ll; typedef unsigned long long ull; typedef unsigned int ui; typedef pair pii; typedef pair ppii; typedef pair pipi; typedef pair pll; typedef pair ppll; typedef pair plpl; typedef tuple tl; ll mod=1000000007; ll mod2=998244353; ll mod3=1000003; ll mod4=998244853; ll inf=1LL<<60; long double pi=3.14159265358979323846L; double eps=1e-12; #define rep(i,m,n) for(ll i=m;i=m;i--) #define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++) int dh[4]={1,-1,0,0}; int dw[4]={0,0,1,-1}; int ddh[8]={-1,-1,-1,0,0,1,1,1}; int ddw[8]={-1,0,1,-1,1,-1,0,1}; ll gcd(ll a,ll b){ if(a0){ if(k&1)ret*=now; now*=now; k/=2; } return ret; } ll beki(ll n,ll k,ll md){ ll ret=1; ll now=n; while(k>0){ if(k%2==1){ ret*=now; ret%=md; } now*=now; now%=md; k/=2; } return ret; } ll gyaku(ll n,ll md){ return beki(n,md-2,md); } int main(){ ios::sync_with_stdio(false);cin.tie(0);cout.tie(0); ll x;cin>>x; ll xx=x; vector a; rep(i,0,9000)a.push_back(10); rep(i,0,900)a.push_back(100); rep(i,0,90)a.push_back(1000); rep(i,0,10)a.push_back(10000); vector b; ll now=1000000000; ll he=100000; for(;;){ ll r=x/he; rep(i,0,r){ b.push_back(now); x-=he; } now/=10; he/=10; if(he==0)break; } b.push_back(1); ll su=0; rep(i,0,a.size()){ su+=a[i]; su%=1000000000; } if(su>=x){ a.push_back(1000000000-su); a.push_back(x); } else{ a.push_back(x-su); } cout<