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 (Python):
N = int(input())
S = input()

if N % 2 != 0:
    print("No")
else:
    sa = S[:(N//2)]
    sb = S[(N//2):]

    if sa == sb:
        print("Yes")
    else:
        print("No")

Solution (Python):
N = int(input())
S = str(input())
S = list(S)

if N % 2 == 1:
    print('No')
else:
    M = N // 2
    A = []
    for i in range(M):
        A.append(S[i])
    B = []
    for i in range(M,N):
        B.append(S[i])
        
    if A == B:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = int(input())
S = list(input())
if S[0:N//2] == S[N//2:N]:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
if n%2==1:
  ans='No'
else:
  a=s[:int(n/2)]
  b=s[int(n/2):]
  if a==b:
    ans='Yes'
  else:
    ans='No'
print(ans)

Solution (Python):
n = int(input())
s = input()

a = n//2

if n % 2 == 0:
  if s[n//2:] == s[:n//2]:
    print('Yes')
    exit()

print('No')

Solution (Python):
n = int(input())
s = input()
print('Yes' if s[:n//2] == s[n//2:] else 'No')

Solution (Python):
n = int(input())
s = input()
if n % 2:
  print("No")
else:
  print("Yes" if s[:n // 2] == s[n // 2:] else "No")

Solution (Python):


N = int(input())
S = input()


if N % 2 != 0:
    print('No')
else:
    s_first = S[:int(N/2)]
    s_second = S[int(N/2):]

    if s_first == s_second:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = input()

if n ==1:
	print('No')
elif s[:n//2] == s[n//2:]:
	print('Yes')
else:
	print('No')

Solution (Python):
N = int(input())
S = input()

if N % 2:
    print('No')
    exit()

for i in range(0, int(N / 2)):
    if S[i] != S[int(N / 2) + i]:
        print('No')
        exit()
print('Yes')

Solution (Python):
n = int(input())
s = input()
if(n % 2 == 0):
  if(s[0:n // 2] == s[n // 2: n]):
    print("Yes")
    exit()
print("No")

Solution (Python):



N = int(input())
S = input()
if len(S) % 2 == 0:
    char1 = S[0:N // 2]
    char2 = S[N // 2: N + 1]
    if char1 == char2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
t=input()
s=input()
a=int(t)
if a%2==1:
  print('No')
else:
  b=a//2
  j=b
  c=0
  for i in range(b):
    if s[i]==s[j]:
      c+=1
      j+=1
      continue
    else:
      break
  if c==b:
    print('Yes')
  else:
    print('No')

Solution (Python):
n = int(input())
s = input()
if(n&1):
  print("No")
else:
  if(s[:n//2]==s[n//2:]):
    print("Yes")
  else:
    print("No")

Solution (Python):
N = int(input())
S = input()
if N % 2 != 0 or N==1:
    print('No')
    exit()

half = N // 2
for i in range(half):
    if S[i] != S[i+half]:
        print('No')
        exit()

print('Yes')

Solution (Python):
N=int(input())
S=input()
if N%2!=0:
  print('No')
else:
  count=0
  for i in range(N//2):
    if S[i]==S[i+(N//2)]:
      count = count
    else:
      count = count+1
    
  if count==0:
    print('Yes')
  else:
    print('No')

Solution (Python):

A = input()
N = input()
if len(N)%2 != 0:
    print("No")
else:
    for i in range(int(len(N)/2)):
        if N[i] != N[i+int(len(N)/2)]:
            print("No")
            break
    else:
        print("Yes")

Solution (Python):
import sys
n = int(sys.stdin.readline())
s = sys.stdin.readline().rstrip()

if n %2 ==1:
    print('No')
else:
    if (s[:(n//2)]) ==(s[(n//2):]):
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = list(input())

flag = 0

if n % 2 == 0 :
    for i in range(n // 2) :
        if s[i] != s[i + n // 2] :
            flag = 1
else :
    flag = 1

if flag == 1 :
    print('No')
else :
    print('Yes')

Solution (Python):
n = int(input())
s = input()

if n % 2 == 1:
  print("No")
else:
  t = n // 2
  if s[0:t] == s[t:n]:
    print("Yes")
  else:
    print("No")

Solution (Python):
n = int(input())
s = input()
if n%2 == 1:
	res = False
s1 = s[0:n//2]
s2 = s[n//2:]
if s1==s2:
	res = True
else:
	res = False

if res:
	print('Yes')
else:
	print('No')

Solution (Python):
n = int(input())
s = input()
if n%2 == 0:
    num=n//2
    if s[:num] == s[num:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
if n%2!=0:
  print("No")
else:
  s=list(s)
  x=n//2
  ss=''.join(s[:x])
  sss=''.join(s[x::])
  if ss==sss:
    print("Yes")
  else:
    print("No")

Solution (Python):
n=int(input())
s=input()

if n%2==1:
    print("No")
else:
    for i in range(n//2):
        if s[i]!=s[i+n//2]:
            print("No")
            break
        if i==n/2-1:
            print("Yes")

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    S = input()

    if N % 2:
        ans = 'No'
    else:
        n = N // 2
        if S[:n] == S[n:]:
            ans = 'Yes'
        else:
            ans = 'No'
    print(ans)


main()

Solution (Python):
n = int(input())
s = input()

if n % 2 == 1:
  print("No")
else:
  print("Yes" if s[:(n//2)] * 2 == s else "No")

Solution (Python):
import os, sys, re, math

N = int(input())
S = input()

if N == 1:
    print('No')
else:
    if S[:N//2] == S[N//2:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = int(input())
S = input()
if N % 2 == 0 and S == S[:N//2] * 2:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
c = n // 2
a = s[:c]
b = s[c:]
if a == b:
    print("Yes")
if a != b:
    print("No")

Solution (Python):
n = input()
s = input()
l = len(s)
l2 = int(l/2)

if l % 2 == 1:
  print("No")
elif s[:l2] == s[l2:]:
  print("Yes")
else:
  print("No")

Solution (Python):
n=int(input())
s=input()
if n%2==0:
    if s[:n//2]==s[n//2:]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):

N = int(input())
S = input()

if N%2 == 1:
    print("No")
else:
    h = N//2
    T1 = S[:h]
    T2 = S[h:]
    if T1 == T2:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s = input()

h = int(n/2)
if s[:h] == s[h:]:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = int(input())
    S = input()

    if N % 2 == 1:
        print('No')
        return

    half = S[:N//2]
    half2 = S[N//2:]

    if half == half2:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = input()
if n % 2 == 0:
    if s[:n//2] == s[n//2:]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
N =  int(input())
S = input()
if S[0:len(S)//2] == S[len(S)//2:len(S)]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 == 1:
    print("No")
else:
    T1 = S[:int(N/2)]
    T2 = S[int(N/2):]

    if T1 == T2:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s = input()

if n%2 == 1:
    print('No')
else:
    for i in range(n//2):
        if not s[i] == s[i+n//2]:
            print('No')
            break
    else:
        print('Yes')

Solution (Python):
n = int(input())
s = input()
if n%2 == 0:
    if s[:n//2] == s[n//2:]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
N = int(input())
S = str(input())

T = ''

for i in range(int(N/2)):
    T += S[i]

TT = T + T

if S == TT:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()
if N == 1:
    print("No")
    exit()

for i in range(1,N):
    s1 = S[:i]
    s2 = S[i:]
    if s1 == s2 and len(s1)*2 == N:
        print("Yes")
        exit()
print("No")

Solution (Python):
N = int(input())
S = str(input())

if (N % 2) == 1:
    print("No")
else:
    num = N/2
    i = 0
    T1 = ""
    T2 = ""
    for val in S:
        i += 1
        if i > num:
            T2 += val
        else:
            T1 += val
    if T1 == T2:
        print("Yes")
    else:
        print("No")

Solution (Python):

n = int(input())
s = list(input())
if n % 2 == 0:
    if s[:(n//2)] == s[(n//2):n]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
count = 0

if n%2==1:
    print("No")
else:
    for i in range(n//2):
        
        if s[i]!=s[n//2+i]:
            count = 1
    if count == 0:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s=input()
if n>1:
  q=n//2
  t1=s[:q]
  t2=s[q:]
  if t1==t2:
    print("Yes")
  else:
    print("No")
  
else:
  print("No")

Solution (Python):
input()
a=input()
if len(a)%2==0 and a[:len(a)//2]==a[len(a)//2:]:
	print("Yes")
else:
	print("No")

Solution (Python):
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())

sys.setrecursionlimit(10 ** 9)


def main():
    N = INT()
    S = INPUT()

    if N%2 == 1:
        print("No")
    else:
        if S[:N//2] == S[N//2:]: print("Yes")
        else: print("No")


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input()

print('Yes' if S[:N//2]==S[N//2:] else 'No')

Solution (Python):
N = int(input())
S = input()

if N % 2 != 0:
        print("No")
        exit()

tmp = N // 2

a1 = S[:tmp]
a2 = S[tmp:]

if a1 == a2:
        print("Yes")
else:
        print("No")

Solution (Python):
n=int(input())
A=input()
if(n%2==0):
    i=0
    j=n//2
    flag=True
    while(i<n//2):
        if(A[i]!=A[j]):
            
            flag=False
            break
        i+=1
        j+=1
    if(flag):
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
nn = n//2
ss = s[:nn]
sss = ss + ss
if sss == s:
	print ("Yes")
else:
	print ("No")

Solution (Python):
N = int(input())
S = input()

mid = N//2

if S[0:mid] == S[mid:]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
T = list(input())
A = T[:N//2]
B = T[N//2:]
if A == B:
  print("Yes")
else:
  print("No")

Solution (Python):
N = int(input())
s = str(input())

x = N // 2

S=[]
for i in s:
    S.append(i)
    
if (S[:x] == S[x:]) and (N % 2 == 0):
    print('Yes')
else:
    print('No')

Solution (Python):
def main(n: int, s: str):
    med = n // 2

    if s[:med] == s[med:]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    n = int(input())
    s = input()

    main(n, s)

Solution (Python):
x=int(input())
a=input()
if x%2==1:
    print("No")
else:
    if a[:x//2]==a[x//2:]:
        print("Yes")
    else:
        print("No")

Solution (Python):
def solve(n, s):
    if n % 2 == 1:
        return "No"
    m = n // 2
    for i in range(m):
        if s[i] != s[m + i]:
            return "No"
    return "Yes"


def main():
    n = int(input())
    s = list(input())
    res = solve(n, s)
    print(res)


def test():
    assert solve(6, "abcabc") == "Yes"
    assert solve(6, "abcadc") == "No"
    assert solve(1, "z") == "No"


if __name__ == "__main__":
    test()
    main()

Solution (Python):
n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()

res = "No"

if N % 2 == 0:
    mid = N // 2
    if S[:mid] == S[mid:]:
        res = "Yes"

print(res)

Solution (Python):
N = int(input())
S = input()

if S[0:N//2] == S[N//2:N]:
    print("Yes")
else:
    print("No")

Solution (Python):
from sys import stdin
n = int(stdin.readline().rstrip())
s = str(stdin.readline().rstrip())

if n % 2 == 1:
    print("No")
else:
    e = n/2
    if s[0:int(e)] == s[int(e):n]:
        print("Yes")
    else:
        print("No")

Solution (Python):

import sys

def _s(): return sys.stdin.readline().strip()
def _i(): return int(sys.stdin.readline().strip())

n = _i()
s = _s()

ans = "No"
if n%2==0:
    nh = n//2
    if s[:nh]==s[nh:]: ans = "Yes"

print(ans)

Solution (Python):
n=int(input())
s=input()

if n % 2 != 0 :
    print('No')
else:
    half = n // 2
    if s[0:half] == s[half:n]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = int(input())
S = input()

if N%2==1:
    print('No')
else:
    N2 = N//2
    if S[:N2]==S[N2:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
def read():
    N = int(input().strip())
    S = str(input().strip())
    return N, S

def solve(N, S):
    if N % 2 == 0:
        half = N // 2
        return S[:half] == S[half:]
    return False

def yesno(flag):
    return "Yes" if flag else "No"

if __name__ == '__main__':
    inputs = read()
    output = solve(*inputs)
    output = yesno(output)
    print("%s" % output)

Solution (Python):
n = int(input())
s = input()

if n % 2 == 1:
    print("No")
    exit()

nhalf = int(n/2)
if s[:nhalf] == s[-1 * nhalf:]:
    print("Yes")
else:
    print("No")

Solution (Python):

N = int(input())
S = input()

sum = 0
if N % 2 == 0:
  for i in range(int(N/2)):
    if S[i] != S[i+int(N/2)]:
      sum += 1
else:
  sum = 1

if sum == 0:
  print("Yes")
else:
  print("No")

Solution (Python):
a=int(input())
s=input()
if a % 2 != 0:
  print('No')
else:
  l=a//2
  if s[:l] == s[l:]:
    print('Yes')
  else:
    print('No')

Solution (Python):
N = int(input())
S = input()
if N%2 == 1:
  print("No")
elif S[:N//2]==S[N//2:]:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = input()
if n%2 == 1:
    print('No')
else:
    if s[:n//2] == s[n//2:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n=int(input())
a=input()
x=n/2
if n%2!=0:
    print("No")
else:
    if a[:int(x)]==a[int(x):]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s = input()
if n%2 == 0:
    t = s[:n//2]
    """
    for i in range(n//2):
        t.append(s[i])
        t.append(t)
    """
    t = t+t
    if s == t:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
a = 0
if N%2 == 1:
    print("No")
else:
    for i in range(N//2):
        if S[i] == S[i+(N//2)]:
            a += 1
    if a == N//2:
        print("Yes")
    else:
        print("No")

Solution (Python):
n=int(input())
S=input()
if n %2 == 1:
    print('No')
    quit()
else:
    U=S[:n//2]
    T=S[n//2:]
    if U == T:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = input()
if n%2 ==1:
    print("No")
    exit()

nn = n//2

a = s[0:nn]
b = s[nn:]

if a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()

flag = True
if N%2==1:
    flag = False
else:
    for i in range(N//2):
        if S[i]!=S[i+N//2]:
            flag = False

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
if N%2==1 or S[:N//2] != S[N//2:]:
  print("No")
else:
  print("Yes")

Solution (Python):
n = int(input())
s = input()
a = s[: n // 2]
b = s[n // 2: ]
if(a == b): print("Yes")
else: print("No")

Solution (Python):
N=int(input())
S=input()
if N%2 == 0:
  if S[0:N//2] == S[N//2:N]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 == 1:
    print("No")
    exit()

if S[0: N // 2] == S[N // 2:]:
    print("Yes")
else:
    print("No")

Solution (Python):


N = int(input())
S = input()
if(N%2 != 0):
  print('No')
else:
  s1 = S[:int(N/2)]
  s2 = S[int(N/2):]
  if(s1 == s2):
    print('Yes')
  else:
    print('No')

Solution (Python):
n = int(input())
s = input()
if n % 2 == 0:
  half = n//2
  ans = "No"
  for i in range(n-half+1):
    if 2*s[i:i+half] == s:
      ans = "Yes"
      break
else:
  ans = "No"
print(ans)

Solution (Python):
import subprocess
import os
import time


import sys
import math
from copy import deepcopy
from collections import deque, defaultdict
from operator import mul
from functools import reduce
sys.setrecursionlimit(20000000)




def main():
    n = int(input())
    s = input()

    if n % 2:
        print('No')
        sys.exit()

    if s[0: int(n/2)] == s[int(n/2):]:
        print('Yes')
        sys.exit()

    print('No')


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = input()
if n%2 != 0:
    print("No")
else:
    if s[:(n//2)] == s[(n//2):]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())

s = input()

if n %2 ==1:
    print("No")

else:
    if s[0:int(n/2)] == s[int(n/2):n]:
        print("Yes")
        
    else:
        print("No")

Solution (Python):
import sys

n = int(input())
s = input()

if (n%2!=0):
    print("No")
    sys.exit(0)

l = n//2
if s[:l] == s[l:]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
sArray = input()

flag = True
if N % 2 == 0:
    n2 = N // 2
    for i in range(N//2):
        if sArray[i] != sArray[i+n2]:
            flag = False
            break
else:
    flag = False

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()

if n % 2 != 0:
    print("No")
else:
    if s[: n // 2] == s[n // 2 :]:
        print("Yes")
    else:
        print("No")

Solution (Python):
N = int(input())
S = input()
if N%2 ==1:
    print("No")
    exit()
else:
    if S[:int(N/2)] == S[int(N/2):]:
        print('Yes')
    else:
        print("No")

Solution (Python):
def main():
    N = int(input())
    S = input()
    if N%2 == 1:
        print('No')
        exit()
    for i in range(N//2):
        if S[i] != S[N//2+i]:
            print('No')
            exit()
    print('Yes')

if __name__ == '__main__': main()

Solution (Python):
n = int(input())
s = input()

h = n // 2

if s[:h] == s[h:]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()

if n%2 == 1:
    print("No")
else:
    if s[:n//2] == s[n//2:]:
        print("Yes")
    else:
        print("No")

Solution (Python):

import sys
import math
input = sys.stdin.readline


def main():
    n = int(input())
    s = input()

    if n % 2 != 0:
        print('No')
        return

    for i in range(int(n/2)):
        if s[i] != s[i + int(n/2)]:
            print('No')
            return

    print('Yes')


if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    s = input()
    h = int(n /2)


    if (n % 2) ==  1:
        print('No')
    else:
        if s[0:h] == s[h:n]:
            print("Yes")
        else:
            print("No")

Solution (Python):
n = int(input())
s = list(input())
b=0
if n%2 == 1:
  print("No")
else:
  for i in range(n//2):
    if s[i] != s[(n//2)+i]:
      b=1
  if b==0:
    print("Yes")
  else:
    print("No")

Solution (Python):
n = int(input())
s = input()

if n % 2 != 0:
    print('No')
    exit()

mid = n // 2

t1 = s[0:mid]
t2 = s[mid:]

print('Yes') if t1 == t2 else print('No')

Solution (Python):
import math
import sys
input = sys.stdin.readline


def main():
    sc = Scan()
    n = sc.intarr()[0]
    s = sc.strarr()[0]
    s1 = s[0:(n//2)]
    s2 = s[(n//2):]
    if s1 == s2:
        print('Yes')
    else:
        print('No')


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


main()

Solution (Python):
n=int(input())
s=list(input())

if n%2==0 and s[:n//2]==s[n//2:]:
    print('Yes')

else:
    print('No')

Solution (Python):
n = int(input())
s = input()

if n % 2 == 0:
    if s[:int(n/2)] == s[int(n/2):]:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
N=int(input())
S=str(input())
x=''
y=''
for i in range(N//2):
  x+=S[i]
for i in range(N//2,N):
  y+=S[i]
if x==y:
  print('Yes')
else:
  print('No')

Solution (Python):
N=int(input())
S=input()

if N%2==1:
  print('No')
else:
  for i in range(N//2):
    if S[i]!=S[i+N//2]:
      print('No')
      break
    elif i==N//2-1:
      print('Yes')

Solution (Python):
n=int(input())
s=input()
n2=int(n/2)
n3=s[0:n2]

if n3*2 == s:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()

h = n // 2
print("Yes" if s[:h] == s[h:] else "No")

Solution (Python):
n = int(input())
s = input()
if n % 2 != 0:
    print("No")
else:
    if(s[:n//2] == s[n//2:]):
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
    print("Yes")
else:
    print("No")

Solution (Python):
import math
import copy
import sys
import fractions
import numpy as np
from functools import reduce
import statistics




def getInputInt():
    inputNum = int(input())
    return inputNum


def getInputListInt():
    outputoData = []
    inputData = input().split()
    outputData = [int(n) for n in inputData]

    return outputData


def getSomeInputInt(n):
    outputDataList = []
    for i in range(n):
        inputData = int(input())
        outputDataList.append(inputData)

    return outputDataList


def getSomeInputListInt(n):
    inputDataList = []
    outputDataList = []
    for i in range(n):
        inputData = input().split()
        inputDataList = [int(n) for n in inputData]
        outputDataList.append(inputDataList)

    return outputDataList




def getInputStr():
    inputNum = str(input())
    return inputNum

n = getInputInt()

s = getInputStr()

tmplist = list(s)
listA = tmplist[0: int(len(s)/2)]
listB = tmplist[int(len(s)/2) : len(s)]

if listA == listB:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
if n %2 ==1:
  print('No')
  exit(0)
for i in range(int(n/2)):
  if s[i] != s[int(i+n/2)]:
    print('No')
    break
else:
  print('Yes')

Solution (Python):
N=int(input())
S=input()
if len(S)%2==1:
    print('No')
elif S[0:N//2]==S[N//2:len(S)]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()
if s[:n//2] == s[n//2:]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
print('Yes' if S[:N//2] == S[N//2:] else 'No')

Solution (Python):
N = int(input())
S = input()

if N % 2 == 0:
    if S[:N//2] == S[N//2:]:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()
flag = 0
if len(S)%2 != 0:
    flag = 1
ans1 = ''
ans2 = ''
for i in range(N):
    if i < N//2:
        ans1+=S[i]
    else:
        ans2+=S[i]
if ans1==ans2 and flag==0:
    print('Yes')
if ans1 != ans2 or flag ==1:
    print('No')

Solution (Python):
n = int(input())
s = input()
half = int(n / 2)
if n % 2 != 0:
    print('No')
else:
    if s[:half] == s[half:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = list(input())
if n % 2 == 1:
  print("No")
else:
  half_s1 = "".join(s[0:n//2])
  half_s2 = "".join(s[n//2:n])
  if half_s1 == half_s2:
    print("Yes")
  else:
    print("No")

Solution (Python):
N = int(input())
S = input()
N_half = N//2
if S == S[:N_half]+S[:N_half]:
    print("Yes")
else:
    print("No")

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = False
def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]



    N = int(input())
    S = input()
    lenstr = len(S)
    if lenstr % 2 == 1:
        print('No')
        return
    else:
        if S[:lenstr//2] == S[lenstr//2:]:
            print('Yes')
        else:
            print('No')
if __name__ == '__main__':
    main()

Solution (Python):
if __name__ == "__main__":
    N = int(input())
    S = input()
    if N % 2 > 0:
        print("No")
    else:
        if S[:N//2] == S[N//2:]:
            print("Yes")
        else:
            print("No")

Solution (Python):
n = int(input())
s = input()

ans = 'No'

if n%2 == 0:
  split_n = n//2
  if s[:split_n] == s[split_n:]:
    ans = 'Yes'
    
print(ans)

Solution (Python):
l = int(input())
s = input()
s1 = s[:l // 2]
s2 = s[l//2:]
if s1 == s2:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = str(input())

if s[:n//2] == s[n//2:]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
l = input()
c = 0
if n%2 == 0:
    for i in range(0,n//2):
        if l[i] == l[i + n//2]:
            continue
        else:
            print('No')
            c = 1
            break
else:
    c = 1
    print('No')
    
if c == 0:
    print('Yes')

Solution (Python):
N = int(input())
S = input()

if N % 2 != 0:
    print('No')
    
else:
    if S[:N//2] == S[-1*N//2:]:
        print('Yes')
        
    else:
        print('No')

Solution (Python):
import sys
N = int(input())
S = input()
if N % 2 == 1:
    print("No")
    sys.exit()
n = N // 2
if S[:n] != S[n:]:
    print("No")
else:
    print("Yes")

Solution (Python):
n = int(input())
s = input()

s1 = s[0:n//2]
s2 = s[n//2:n]




if s1 == s2:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 != 0:
  print('No')
  quit()

middle = int(N / 2)
if S[:middle] == S[middle:]:
  print('Yes')
else:
  print('No')

Solution (Python):
n=int(input())
if n%2==1:
    print("No")
    exit()
s=input()
for i in range(n//2):
    if s[i]!=s[n//2+i]:
        print("No")
        break
else:
    print("Yes")

Solution (Python):
import sys
sys.setrecursionlimit(10**6)

ii = lambda: int(input())
mis = lambda: map(int,input().split())
lmis = lambda: list(mis())
INF = float('inf')

def main():
    N=ii()
    if N%2:
        print('No')
        exit()
    S=list(input())
    s1=S[:N//2]
    s2=S[N//2:]
    for i in range(N//2):
        if s1[i]!=s2[i]:
            print('No')
            exit()
    print('Yes')


if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
s=list(input())

if s[:n//2]==s[n//2:]:
    print("Yes")

else:
    print("No")

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	N = inputInt()
	S = input()
	S = S[:-1]

	if N % 2 == 1:
		print("No")
		sys.exit()

	tmp = int(N / 2)
	if S[:tmp] == S[tmp:]:
		print("Yes")
	else:
		print("No")


if __name__ == "__main__":
	main()

Solution (Python):
import sys
input = sys.stdin.readline

import numpy as np

def main():
    n = int(input())
    s = input().rstrip()

    x = n//2



    if s[:x] == s[x:]:
        print("Yes")
    else:
        print("No")



if __name__ == '__main__':
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10**7)

N = int(input())
S = str(input())



if N % 2 == 0 and S[0:int(N/2)] == S[int(N/2):]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
if s[:int(n/2)] == s[int(n/2):]:
  print('Yes')
else:
  print('No')

Solution (Python):
n=int(input())
s=input()

if len(s)%2==1:
  print("No")
else:
  if s[:n//2]==s[n//2:]:
    print("Yes")
  else:
    print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 == 1:
    print('No')
else:
    if S[:N // 2] == S[N // 2:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
list1 = list(input())
s = n//2
if n%2 != 0:
    print("No")
else:
    a = list1[:s]
    b = list1[s:]
    if a == b:
        print("Yes")
    else:
        print("No")

Solution (Python):
n=int(input())
s=input()
l = len(s)
if n%2==0:
  if s[:int(n/2)] == s[int(n/2):]:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Solution (Python):
n = int(input())
s = input()

if s[:(n//2)] == s[(n//2):]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()
if S[:int(N / 2)] == S[int(N / 2):]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
if N % 2 != 0:
    print("No")
    quit()
else:
    if S[:N//2] == S[N//2:]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(input())
s = input()

flag = True

if (n%2 != 0):
    flag = False
else:
    s1 = s[:int(n/2)]
    s2 = s[int(n/2):]
    if (s1 != s2):
        flag = False

if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
if n%2==1:
    print("No")
    exit()
t=s[:int(n/2)]
if t+t==s:
    print("Yes")
else:
    print("No")

Solution (Python):
S = int(input())
N = input()
if len(N) % 2 == 0:
    for i in range(len(N) // 2):
        if not N[i] == N[len(N) // 2 + i]:
            break
    else:
        print("Yes")
        exit()

print("No")

Solution (Python):
N = int( input() )
a = N // 2
e_list = list( input() )
if e_list[0:a] == e_list[a:N+1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 != 0:
    print('No')
else:
    n = int(N / 2)
    if S[:n] == S[n:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = input()
if n % 2 == 0 :
    half = s[:n//2]
    if s == half*2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):


N = int(input())
S = list(str(input()))

if N % 2 == 1:
    print("No")
else:
    a = 0
    for i in range(int(N/2)):
        if S[i] == S[int(N/2) + i]:
            a += 1
    if a == int(N/2):
        print("Yes")
    else:
        print("No")

Solution (Python):
N = int(input())
S = input()

if N % 2 != 0:
    print("No")
else:
    N_left = S[0:N//2]
    N_right = S[N//2:N]
    if N_right == N_left:
        print("Yes")
    else:
        print("No")

Solution (Python):


N=int(input())
S=list(input())

if N%2==1:
    print("No")
else:
    a="".join(S[:N//2])
    b="".join(S[::-1][:N//2][::-1])
    if a==b:
        print("Yes")
    else:
        print("No")

Solution (Python):
l = int(input())
a = input()
if a[0:int(l/2)] == a[int(l/2):]:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
s=input()
if s[:n//2] == s[n//2:]:
  print("Yes")
else:
  print("No")

Solution (Python):
n = int(input())
s = input()
if n % 2 == 1:
    print("No")
    exit()
else:
    if s[0:int(n/2)] == s[int(n/2):]:
        print("Yes")
    else:
        print("No")

Solution (Python):
import sys
n = int(input())
s = list(input())


if n % 2 == 1:
    print('No')
    sys.exit()

else:
    lent = int(n / 2)
    if s[:lent] == s[lent:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
n = int(input())
s = input()

def cond():
    if n % 2 == 1:
        return False
    else:
        return s[:n//2] == s[n//2:]

if cond():
    print('Yes')
else:
    print('No')

Solution (Python):
N = int(input())
S = input()

a = S[0 : int(N / 2)]
b = S[int(N / 2) :]
if a == b:
    print("Yes")
else:
    print("No")