#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
ll MOD=998244353;
#define all(x) x.begin(), x.end()
#define rep(i, n) for(ll i = 0; (i) < (n); (i)++)
template<class T>
auto comp_idx(const T* ptr){
  return [ptr](auto l_idx, auto r_idx){
    return ptr[l_idx] < ptr[r_idx];
  };
}
template<class T>
vector<ll> IndexSort(T vec){
    vector<ll> ind(vec.size());
    iota(all(ind), 0);
    sort(all(ind), comp_idx(vec.data()));
    return ind;
}
void yn(bool flag){
  string ans = (flag) ? "Yes" : "No";
  cout<<ans<<endl;
}

int main(){
  string n; cin>>n;
  ll point5=0;
  rep(i, n.size()){
    if(n[i] - '0' < 4){
      if(i>0) cout<<4;
      rep(j, n.size()-point5-1) cout<<5;
      return 0;
    }else if(n[i]-'0' == 5){
      for(ll j=point5; j<i; j++){
        cout<<n[j];
      }
      point5=i;
    }else if(n[i] - '0' > 5){
      for(ll j=point5; j<i; j++){
        cout<<n[j];
      }
      rep(j, n.size()-i){
        cout<<5;
      }
      return 0;
    }
  }
  for(ll i=point5; i<n.size(); i++){
    cout<<n[i];
  }
}