#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define ull unsigned long long
#define pll pair<ll,ll>
#define pb push_back
#define emb emplace_back
#define lg(x) __lg(x)
#define all(s) s.begin(),s.end()
#define name "test"
#define Mask(i) (1LL<<i)
#define testbit(mask, i) ((mask >> i) & 1LL)
#define onBit(mask, i) (mask | (1LL << i))
#define offBit(mask, i) (mask & ~(1LL << i))
#define flipBit(mask, i) (mask ^ (1LL << i))
#define showbit(mask, x) bitset<x>(mask)
const ll mod = 1e9 + 7;

void add(ll &a, ll b){
     if((a += b) >= mod) a -= mod;
}


const ll inf = 1e18;
const ll lim = 1e7 + 5;
const ll N = 2e5 + 5;

string hieu(string s, ll k)
{
     string t = to_string(k);
     int i = s.size() - 1, j = t.size() - 1, nho = 0;

     while(j >= 0 || nho)
     {
          int x = s[i] - '0' - nho;
          int y = (j >= 0 ? t[j] - '0' : 0);

          if(x < y){
               x += 10;
               nho = 1;
          }
          else nho = 0;

          s[i] = char(x - y + '0');
          i--;
          j--;
     }

     while(i >= 0)
     {
          int x = s[i] - '0' - nho;
          if(x < 0){
               s[i] = '9';
               nho = 1;
          }
          else{
               s[i] = char(x + '0');
               nho = 0;
          }
          i--;
     }

     int p = 0;
     while(p + 1 < s.size() && s[p] == '0') p++;
     return s.substr(p);
}

bool check(string s, ll k){
     string t = to_string(k);
     if(s.size() < t.size()) return true;
     else if(s.size() == t.size()){
          for(int i = 0; i < s.size(); i++){
               if(t[i] > s[i]) return true;
          }
     }

     return false;
}
int main()
{
     ios_base::sync_with_stdio(0);
     cout.tie(0);cin.tie(0);
     if(fopen(name".inp","r")){
          freopen(name".inp","r",stdin);
          freopen(name".out","w",stdout);
     }

     string s; cin >> s;
     for(int k = 9 * 100; k >= 1; k--){
          if(check(s, k)) continue;
          string m = hieu(s, k);

          int sum = 0;
          for(int i = 0; i < m.size(); i++) sum += m[i] - '0';

          if(sum == k){
               cout << m;
               return 0;
          }
     }
     cout << 0;


}