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 Java8 (OpenJDK 1.8.0) (judge verdict: Runtime Error)

import java.util.*;

public class Main {
    public static void main(String[] args) {

        Scanner sc = new Scanner(System.in);

        int size = Integer.valueOf(sc.nextLine());
        int[] numbers = new int[size];

        int[] kisuu_numbers = new int[100001];
        int[] guusuu_numbers = new int[100001];

        int most_kisuu_number = 0;
        int most_gusuu_number = 0;


        String[] tmp = sc.nextLine().split(" ");
        for (int i = 0; i < size; i++) {
            numbers[i] = Integer.valueOf(tmp[i]);
            if ((i+1) % 2 == 1) {
                kisuu_numbers[numbers[i]]++;
            } else {
                guusuu_numbers[numbers[i]]++;
            }
        }
        int max = 0;
        for (int i = 0; i < kisuu_numbers.length; i++) {

            if (kisuu_numbers[i] > max) {
                max = kisuu_numbers[i];
                most_kisuu_number = i;
            }
        }
        max = 0;
        for (int i = 0; i < guusuu_numbers.length; i++) {
            if (guusuu_numbers[i] > max) {
                max = guusuu_numbers[i];
                most_gusuu_number = i;
            }

        }
        int kaikaesuu = (size / 2 - kisuu_numbers[most_kisuu_number]) + (size / 2 -guusuu_numbers[most_gusuu_number]);
        System.out.println(kaikaesuu);


    }
}