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,a[100000],b[100000],k,l,i,j,z,count[2];
    scanf("%d",&n);
    for( i=0;i<n;i++){
        if(i%2==0){
            scanf("%d",&a[i/2]);
        }else{
            scanf("%d",&b[i/2]);
    };
    }

    count[0]=0;
    count[1]=0;
for(i=0;i<n/2;i++){
    k=1;
    for(j=0;j<n/2;j++){
        if(a[i]==a[j]){
            k++;
        }
                    if(count[0]<k-1){
                count[0]=k-1;
                l=a[i];
            }
    }
    }

for(i=0;i<n/2;i++){
    k=1;
    for(j=0;j<n/2;j++){
        if(b[i]==b[j]){
            k++;
        }
                    if(count[1]<k-1){
                count[1]=k-1;
                z=b[i];
            }
    }
    }
    if(z!=l){
    printf("%d",n-count[1]-count[0]);
    }else{
        if(count[0]<count[1]){
                printf("%d",n-count[1]);
        }else{
                printf("%d",n-count[0]);
        }
    }
    return 0;
}