#ifdef MAIN 
bool __multi__ = 0;

namespace XK {

	bool cmp(string S, string T) {
		if(sz(S) > sz(T)) return 1;
		if(sz(S) < sz(T)) return 0;
		rep(i, sz(S)) if(S[i] != T[i]) return S[i] > T[i];
		return 1;
	}

  void solve() {
  	string S; cin >> S;
  	rep(i, sz(S)) {
  		if(S[i] > '5') {
  			rep(j, i) cout << S[j];
  			Rep(j, i, sz(S)) cout << '5';
  			return;
  		}
  		if(S[i] < '4') {
  			bool flg = 0;
  			rrep(j, 0, i) if(S[j] == '5') {
  				S[j] = '4';
  				Rep(k, j + 1, i + 1) S[k] = '5';
  				flg = 1; break;
  			}
  			Rep(j, i + 1, sz(S)) S[j] = '5';
  			if(!flg) {
  				Rep(j, 1, i + 1) S[j] = '5';
  				S.erase(S.begin());
  			}
  			rep(j, sz(S)) cout << S[j];
  			return;
  		}
  	}
  	rep(i, sz(S)) cout << S[i];
  }
};

#else
#include "cassert"
#include "cmath"
#include "cstdint"
#include "cstdio"
#include "cstdlib"
#include "cstring"
#include "algorithm"
#include "bitset"
#include "chrono"
#include "complex"
#include "deque"
#include "functional"
#include "iostream"
#include "limits"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "sstream"
#include "string"
#include "unordered_map"
#include "unordered_set"
#include "utility"
#include "vector"
#include "array"
using namespace std;
#define int long long
using ll = long long;
using ull = unsigned long long;
const ll INF = 1ll << 60;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
template <class A, class B> bool chmax(A& l, const B& r){ return r > l ? l = r, 1 : 0; }
template <class A, class B> bool chmin(A& l, const B& r){ return r < l ? l = r, 1 : 0; }
#define sz(x) ssize(x)
#define rep(i, a) for(ll i = 0; i < (a); i ++)
#define Rep(i, a, b) for(ll i = (a); i < (b); i ++)
#define rrep(i, a, b) for(ll i = (b); i --> (a); )
#define all(x) begin(x), end(x)
#define fst first
#define snd second
#define pb push_back
template<class T> using V = vector<T>;
template<class T, std::size_t N> using AR = array<T, N>;
#define MAIN
#include __FILE__
signed main() {ios::sync_with_stdio(0);cin.tie(0);fixed(cout).precision(12);int t = 1;if(__multi__) cin >> t;while(t --) XK::solve();}
#endif