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 Python (3.4.3) (judge verdict: Runtime Error)

str_num = input()
input_str = input()
input_array = list(input_str)

match_num = 0
int_str_num =int(str_num)

if int_str_num % 2 == 0:
  half_str_num = int_str_num/2
  int_half_str_num = int(half_str_num)
  for i in range(int_half_str_num):
    if input_array[i] == input_array[i+int_half_str_num]:
      match_num = match_num + 1
    
  if n == half_str_num:
    print('Yes')
  else:
    print('No')
else:
  print('No')