Problem:
Score : 100 points

Problem Statement

Cat Snuke is learning to write characters.
Today, he practiced writing digits 1 and 9, but he did it the other way around.

You are given a three-digit integer n written by Snuke.
Print the integer obtained by replacing each digit 1 with 9 and each digit 9 with 1 in n.

Constraints

111 \leq n \leq 999

n is an integer consisting of digits 1 and 9.

Input

Input is given from Standard Input in the following format:

n

Output

Print the integer obtained by replacing each occurrence of 1 with 9 and each occurrence of 9 with 1 in n.

Sample Input 1

119

Sample Output 1

991

Replace the 9 in the ones place with 1, the 1 in the tens place with 9 and the 1 in the hundreds place with 9. The answer is 991.

Sample Input 2

999

Sample Output 2

111

Solution in Common Lisp (SBCL 1.1.14) (judge verdict: Accepted)

(defun main ()
  (let ((n (concatenate 'list (read-line)))
        (tmp ""))
    (labels ((change (lst)
                    (let ((v (car lst)))
                      (if (equal v #\1)
                          (setq tmp (concatenate 'string tmp "9"))
                          (if (not (null v))
                              (setq tmp (concatenate 'string tmp "1"))
                              (return-from change nil)))
                      (change (cdr lst)))))
      (change n)
      (princ tmp))))

(main)