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 C++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#define rep(i,n) for(int i=0;i<n;i++)
#define ll long long
using namespace std;



int main(){

	int n,ans[3];
	cin >> n;
	ans[0] = n / 100;
	n %= 100;
	ans[1] = n / 10;
	n %= 10;
	ans[2] = n;
	rep(i, 3) {
		if (ans[i] == 1) ans[i] = 9;
		else if (ans[i] == 9) ans[i] = 1;
	}

	n = 100 * ans[0] + 10 * ans[1] + ans[2];

	cout << n << endl;

	return 0;
}