Problem:
Score : 700 points

Problem Statement

Given is a sequence of N digits a_1a_2\ldots a_N, where each element is 1, 2, or 3.
Let x_{i,j} defined as follows:

x_{1,j} := a_j \quad (1 \leq j \leq N)

x_{i,j} := | x_{i-1,j} - x_{i-1,j+1} | \quad (2 \leq i \leq N and 1 \leq j \leq N+1-i)

Find x_{N,1}.

Constraints

2 \leq N \leq 10^6

a_i = 1,2,3 (1 \leq i \leq N)

Input

Input is given from Standard Input in the following format:

N
a_1a_2\ldotsa_N

Output

Print x_{N,1}.

Sample Input 1

4
1231

Sample Output 1

1

x_{1,1},x_{1,2},x_{1,3},x_{1,4} are respectively 1,2,3,1.

x_{2,1},x_{2,2},x_{2,3} are respectively |1-2| = 1,|2-3| = 1,|3-1| = 2.

x_{3,1},x_{3,2} are respectively |1-1| = 0,|1-2| = 1.

Finally, x_{4,1} = |0-1| = 1, so the answer is 1.

Sample Input 2

10
2311312312

Sample Output 2

0

Solution in C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;

namespace _20200321
{
    class Program
    {
        static void Main()
        {
            var n = int.Parse(Console.ReadLine());
            var aStr = Console.ReadLine();
            var aList = new List<int>();
            for (var ni = 0; ni < n; ++ni)
            {
                aList.Add(int.Parse(aStr[ni].ToString()));
            }
            for (var i = 2; i <= n; ++i)
            {
                for (var j = 0; j < n + 1 - i; ++j)
                {
                    aList[j] = aList[j] > aList[j + 1] ? aList[j] - aList[j + 1] : aList[j + 1] - aList[j];
                }
                Console.WriteLine(String.Concat(aList));
            }
            Console.WriteLine(aList[0]);
        }
    }
}