Problem:
Score : 200 points

Problem Statement

Given are a positive integer N and a string S of length N consisting of lowercase English letters.

Determine whether the string is a concatenation of two copies of some string.
That is, determine whether there is a string T such that S = T + T.

Constraints

1 \leq N \leq 100

S consists of lowercase English letters.

|S| = N

Input

Input is given from Standard Input in the following format:

N
S

Output

If S is a concatenation of two copies of some string, print Yes; otherwise, print No.

Sample Input 1

6
abcabc

Sample Output 1

Yes

Let T = abc, and S = T + T.

Sample Input 2

6
abcadc

Sample Output 2

No

Sample Input 3

1
z

Sample Output 3

No

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

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace ConsoleApp11
{
    class Program
    {
        static void Main()
        {
            int N = int.Parse(Console.ReadLine());
            string S = Console.ReadLine();

            int count = S.Length;
            char[] char1 = new char[N/2];
            char[] char2 = new char[N/2];

            for (int i = 0; i < N / 2; i++)
            {
                char1[i] = S[i];
                char2[i] = S[i + N / 2];
            }
            if (N % 2 == 1)
                Console.WriteLine("No");
            else if (char1.ToString() == char2.ToString())
                Console.WriteLine("Yes");
            else
                Console.WriteLine("No");
            
        }
    }
}