import bisect
import math
import sys
from itertools import accumulate
from math import isqrt, inf
from typing import List, Tuple

sys.setrecursionlimit(10 ** 6)

MOD = 998244353

int1 = lambda x: int(x) - 1
input = lambda: sys.stdin.readline().rstrip('\n')
ii = lambda: int(input())
vi = lambda: list(map(int, input().split()))
vi1 = lambda: list(map(int1, input().split()))


def dbg(*args, **kwargs):
    print(*(repr(arg) for arg in args), *(f'{k}: {repr(v)}' for k, v in kwargs.items()),
          sep='; ', file=sys.stderr, flush=True)


def main():
    n = input()
    if n < '4' * len(n):
        return '5' * (len(n) - 1)
    n = list(n)

    for i in range(len(n)):
        if n[i] > '5':
            for j in range(i, len(n)):
                n[j] = '5'
            return ''.join(n)
        if n[i] < '4':
            for j in range(i - 1, -1, -1):
                if n[j] == '5':
                    n[j] = '4'
                    for k in range(j + 1, len(n)):
                        n[k] = '5'
                    return ''.join(n)
    return ''.join(n)


def _start():
    if (ret := main()) is not None:
        print(*ret) if isinstance(ret, List) or isinstance(ret, Tuple) else print(ret)


if __name__ == '__main__':
    _start()