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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>

int main()
{
int n, i, even[2000000], odd[2000000], a[2000000], max_even=0, max_odd=0, value_even, value_odd;
scanf("%d", &n);
for(i=0;i<n;i++){
even[i]=0;
odd[i]=0;
}
for(i=0;i<n;i++){
scanf("%d", &a[i]);
if(i%2==0)even[a[i]]++;
else odd[a[i]]++;
}
while(1){
for(i=0;i<200000;i++){
if(max_even<=even[i]){
max_even=even[i];
value_even=i;
}
if(max_odd<=odd[i]){
max_odd=odd[i];
value_odd=i;
}
}
if(value_even!=value_odd)break;
else{
if(max_even>max_odd)odd[value_odd]=0;
else even[value_even]=0;
max_even=0;
max_odd=0;
value_even=0;
value_odd=0;
}
}
int k=n-max_odd-max_even;
printf("%d\n", k);
return 0;
}