# coding: utf-8
import array, bisect, collections, copy, heapq, itertools, math, random, re, string, sys, time
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 20
MOD = 10 ** 9 + 7


def II(): return int(input())
def ILI(): return list(map(int, input().split()))
def IAI(LINE): return [ILI() for __ in range(LINE)]
def IDI(): return {key: value for key, value in ILI()}


def read():
    N = II()
    return (N,)


def solve(N):
    A = []
    B = []
    l_num = list(str(N))
    for char in l_num[::-1]:
        if char == "7":
            A.append("6")
            B.append("1")
        else:
            A.append(char)
            B.append("0")

    num_A = int("".join(A[::-1]))
    num_B = int("".join(B[::-1]))
    ans = "{} {}".format(num_A, num_B)
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()