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# (Mono 4.6.2.0) (judge verdict: Runtime Error)

using System;
using System.Collections.Generic;
using System.Linq;

namespace ABC111_C
{
    class Program
    {
        static void Main(string[] args)
        {
            var n = long.Parse(Console.ReadLine());
            var v = Console.ReadLine().Split().Select(long.Parse).ToArray();

            if (v.Distinct().Count() == 1)
            {
                Console.WriteLine(n / 2);
                return;
            }

            var ve = new Dictionary<long, long>();
            var vo = new Dictionary<long, long>();

            for (long i = 0; i < v.Length; i++)
            {
                if (i % 2 == 0 || i == 0)
                {
                    if (ve.Keys.Contains(v[i]))
                    {
                        ve[v[i]]++;
                    }
                    else
                    {
                        ve.Add(v[i], 1);
                    }
                }
                else
                {
                    if (vo.Keys.Contains(v[i]))
                    {
                        vo[v[i]]++;
                    }
                    else
                    {
                        vo.Add(v[i], 1);
                    }
                }
            }

            bool twoTop = false;
            var veMost = ve.OrderByDescending(x => x.Value).Take(2).ToList();
            if (veMost.Count > 1 && veMost[0].Value == veMost[1].Value) twoTop = true;

            var voMost = vo.OrderByDescending(x => x.Value).Take(2).ToList();
            if (veMost.Count > 1 && voMost[0].Value == voMost[1].Value) twoTop = true;

            var cntve = ve.Select(x => x.Value).OrderByDescending(x => x).Skip(1).Sum();
            var cntvo = vo.Select(x => x.Value).OrderByDescending(x => x).Skip(1).Sum();

            if (veMost[0].Key == voMost[0].Key && !twoTop)
            {
                Console.WriteLine(cntve + n / 2 - cntvo);
            }
            else
            {
                Console.WriteLine(cntve + cntvo);
            }
        }
    }
}