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()

ans = "No"


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

print(ans)

Solution (Python):
import sys
N = int(input())
S = input()
s1 = S[:N//2]
s2 = S[N//2:]
if N%2 == 1:
    print("No")
    sys.exit()
for i in range(N//2):
    if not s1[i] == s2[i]:
        print("No")
        sys.exit()
print("Yes")

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

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

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

if len(s) % 2 != 0:
    ans = 'No'
else:
    h = len(s) // 2
    t1 = s[:h]
    t2 = s[h:]
    if t1 == t2:
        ans = 'Yes'
    else:
        ans = 'No'
print(ans)

Solution (Python):
a = input()

a = int(a)

b = input()

if a%2 == 1:
    print('No')
    exit(0)

if (b[0:(a//2)] == b[(a//2):]):
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import math

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

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

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

n = int(n)

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):
def get_input():

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

    return N, S


def main():

    N, S = get_input()

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

    if S[int(N / 2):] == S[:int(N/2)]:
        print('Yes')
        return

    print('No')


main()

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

Solution (Python):
n=int(input())
s=list(input())
ans = 'Yes'
if(n % 2 == 0):
    N = int(n / 2)
    for i in range(N):
        if(s[i] != s[i + N]):
            ans = 'No'
else:
    ans = 'No'

print(ans)

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

Solution (Python):
import sys

def solve(n, s):
    if n % 2 == 1:
        print("No")
        return

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

if __name__ == '__main__':
    n = int(sys.stdin.readline().strip())
    s = sys.stdin.readline().strip()
    solve(n, s)

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

Solution (Python):

N =int(input())
S = str(input())
S_1 = S[:int(N/2)]
S_2 = S[int(N/2):]

if N % 2 != 0:
    print("No")
elif S_1== S_2:
    print("Yes")
else:
    print("No")

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

s_list = list(s)

ans = 'Yes'

if n % 2 == 1:
    ans = 'No'
else:
    char_first_t = 0
    char_second_t = (n//2)
    for i in range(n//2):
        f = s_list[char_first_t]
        sec = s_list[char_second_t]
        if f != sec:
            ans = 'No'
        char_first_t += 1
        char_second_t += 1
        
print(ans)

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

s1 = s[:int(length/2)]
s2 = s[int(length/2):]



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

Solution (Python):


n=int(input())  
s=str(input())  
center = n//2
if n%2==1:
    print("No")
    exit()
first = s[:center]
second = s[center:]
if first == second:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time

def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
ts=time.time()
sys.setrecursionlimit(10**6)

show_flg=False
show_flg=True

ans=0
n=I()
s=input()
k=1
t=s[:n//2]
u=s[n//2:]
if n%2==1:
    k=1
elif t==u:
    k=0


print(YN[k])

Solution (Python):
import sys
import itertools
sys.setrecursionlimit(10**8)

def solve():
  n = int(input())
  s = input()
  if n%2 == 1:
    print("No")
    exit()
  ts = s[0:n//2]
  t2s = s[n//2::]
  if ts == t2s:
    print("Yes")
  else:
    print("No")
solve()

Solution (Python):

class Solution:
    def solve(self, n: int, s: str) -> str:

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

        if s1 == s2:
            return "Yes"
        else:
            return "No"


if __name__ == '__main__':

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

    
    solution = Solution()
    print(solution.solve(n, s))

Solution (Python):
N=int(input())
S=input()
n=int(len(S))
l=int(n/2)
a=""
b=""
if n%2==0:
    for i in range(l):
        a+=S[i]
    for i in range(l,n):
        b+=S[i]
    if a==b:
        print("Yes")
    else:
        print("No")
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 = str(input())
print('Yes'if s[0:(n//2)]==s[(n//2):] else 'No')

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

if len(S)%2 != 0:
    print('No')
else:
        if all(S[i] == S[i+N//2] for i in range(len(S)//2)):
            print('Yes')
        else:
            print('No')

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

Solution (Python):
import sys

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

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

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

print("Yes")

Solution (Python):



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

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

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

flag = "No" 

for i in range(length):
	if (s[:i] == s[i:]):
		flag = "Yes"
		break

print(flag)

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

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

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

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

Solution (Python):
import sys

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

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

x = N//2

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

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

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

elif s[0:int(n/2)] == s[int(n/2):n]:
  print("Yes")

else:
  print("No")

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

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

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

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

Solution (Python):
N = int(input())
S = list(input())
if N % 2 == 1:
  print("No")
  exit()
half = int(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:
  tn = N // 2


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

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

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

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

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

for i in range(int(n/2)):
  if s[i] == s[i+int(n/2)]:
    num += 1
    
if num == int(n/2):
  print("Yes")
else:
  print("No")

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

S1 = []
S2 = []

for i in range(int(N/2)):
    S1.append(S[i])
    S2.append(S[i+int(N/2)])
    
if S1 == S2:
    if N%2 == 1:
        print('No')
    else:
        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 = str(input())

head = s[:int(n/2)]
tail = s[int(n/2):]

if n == 1:
    print('No')
elif head == tail:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

half = int(n/2)

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

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

ans='Yes'

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

if N%2==0:
    for i in range(N//2):
        if S[i]!=S[N//2+i]:
            ans='No'
            break
    print(ans)

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

han = N // 2
if N % 2 != 0:
    print('No')
    exit()

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

Solution (Python):
import sys

lines = sys.stdin.readlines()

N = int(lines[0].rstrip())
S = lines[1].rstrip()

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

    if zenhan == kouhan:
        print('Yes')
    else:
        print('No')

Solution (Python):
input()
S = raw_input()
print "Yes" if S==S[:len(S)/2]*2 else "No"

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

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

Solution (Python):
import sys
N = int(input())
S = list(input())

if N % 2 == 0:
	T = S[:int(len(S)/2)]
	T_end = S[int(len(S)/2):]

	for i in range(len(T)):
		if T[i] != T_end[i]:
			print('No')
			sys.exit()

	print('Yes')
	sys.exit()
else:
	print('No')

Solution (Python):


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

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

Solution (Python):
N = int(input())
if N%2 == 1:
    print("No")
else:
    S = input()
    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()


T = S[0:N//2]

if S == T + T:
    print("Yes")
else:
    print("No")

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


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

right = S[:len(S)//2]
left = S[(len(S)//2):]

ans = 'Yes'
for i, rc in enumerate(right):
    if left[i] != rc:
        ans = 'No'

print(ans)

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

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

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

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

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

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

S = input()

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

T1 = S[0:len(S)//2:1]
T2 = S[len(S)//2:len(S):1]




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

Solution (Python):
N=int(input())
S=input()
if N%2==1:
  print("No")
else:
  s=""
  b=""
  for j in range(N//2):
    s=s+str(S[j])
  for i in range(N//2,len(S)):
    b=b+str(S[i])
  if s==b:
    print("Yes")
  else:
    print("No")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    n = INT()
    if n % 2 != 0:
        print('No')
        sys.exit()
    s = input()
    m = int(n/2)
    s1 = [s[i] for i in range(m)]
    s2 = [s[i] for i in range(m, n)]
    if s1 == s2:
        print('Yes')
    else:
        print('No')


if  __name__=='__main__':
    main()

Solution (Python):
n = int(input())
s = input()
half = n//2

if half == 0:
  				print("No")

elif s == (s[0:half] + s[0:half]):
                 print("Yes")
else:
                 print("No")

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

Solution (Python):
def main():
    
    
    N = int(input())
    S = input()
    flag = False
    for i in range(N):
        s1 = S[:i]
        s2 = S[i:]
        if s1 == s2:
            flag = True
    print('Yes' if flag else 'No')


if __name__ == "__main__":
    main()

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

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

if num%2 == 0:
    a = int(num /2)
    half_s = s[:a]

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

Solution (Python):
N = int(input())
S = str(input())
if N%2 == 1:
  print('No')
else:
  dev = int(N/2)
  str_mae = S[0:dev] 
  str_usiro = S[dev:] 
  if str_mae == str_usiro:
    print('Yes')
  else:
    print('No')

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

if (n%2 == 0):
    half = int(n/2)

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

Solution (Python):
import sys
input = sys.stdin.readline
def print_ans(N, S):
    """Test Case
    >>> print_ans(6, "abcabc")
    Yes
    >>> print_ans(6, "abcadc")
    No
    >>> print_ans(1, "z")
    No
    """
    if N % 2 != 0:
        print("No")
    else:
        if S[:N//2] == S[N//2:]:
            print("Yes")
        else:
            print("No")

if __name__ == '__main__':
    N = int(input().rstrip())
    S = input().rstrip()
    print_ans(N, S)

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

Solution (Python):

si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n=ni()
s=si()

if n%2==1:
    print('No')
else:
    nn = int(n/2)
    ss = s[0:nn]
    a = s.count(ss)
    if a==2:
        print('Yes')
    else:
        print('No')

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

term = N//2
if s == s[:term] + s[:term]:
    print("Yes")
else:
    print("No")

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

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

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

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

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

if N%2 != 0:
    print "No"
else:
    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:
    print('No')
elif S[:N//2]==S[N//2:]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()
n2 = int(n/2)

if n % 2 == 1:
	print("No")
	exit()
else:
	for i in range(n2):
		if s[i] != s[i+n2]:
			print("No")
			exit()

print("Yes")

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

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

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

for i in range(n//2):
    if s[i]!=s[i+n//2]:
        print("No")
        sys.exit()
print("Yes")

Solution (Python):
from sys import stdin
from itertools import accumulate, dropwhile, takewhile, groupby
import bisect
import copy
import math

N = int(stdin.readline().rstrip())
S = stdin.readline().rstrip()

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

Solution (Python):
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


def I(): return int(sys.stdin.readline())


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res



def A():
    r = I()
    print(r * r)
    return



def B():
    N = I()
    s = S()
    if N % 2 != 0:
        print("No")
    elif ''.join(s[:N // 2]) == ''.join(s[N // 2:]):
        print("Yes")
    else:
        print("No")
    return



def C():
    return



def D():
    return



def E():
    return



def F():
    return



def resolve():
    B()
    return



if __name__ == "__main__":
    B()

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):

def main():
    n=int(input())
    s=list(input())
    if n %2 ==1:
        print('No')
        return
    m=int(n/2)
    for i in range(0,m):
        if s[i]==s[m+i]:
            continue
        else:
            print('No')
            return
    print('Yes')
if __name__ == '__main__':
    main()

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

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

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

pre=s[0:n//2]
post=s[n//2:]

if (pre == post):
    print('Yes')
else:
    print('No')

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

Solution (Python):
N=int(input()) 
s = input()
flag = False
if N%2 ==0:
  if s[:N//2]==s[N//2:]:
    flag =True


print('YNeos'[not( flag )::2])

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

Solution (Python):
n = int(input())
s = str(input())
if len(s) % 2 != 0:
    print('No')

elif s[:int(n/2)] == s[int(n/2):]:
    print('Yes')

else:
    print('No')

Solution (Python):
N = int(input())
S = str(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 = input()
if N % 2 == 0:
    half = int(N / 2)
    first = S[0:half]
    second = S[half:]

    if first == second:
        print('Yes')
    else:
        print("No")
else:
    print("No")

Solution (Python):
N = int(input())
S = input()
ans = 'No'

if N % 2 == 0:
    l = N // 2
    if S[:l] == S[l:]:
        ans = 'Yes'

print(ans)

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

Solution (Python):
import sys
N = int(input())
S = input()
l = len(S)
if l % 2 != 0:
    print('No')
    sys.exit(0)
h  = l // 2
if S[:h] == S[h:]:
    print('Yes')
    sys.exit(0)
print('No')

Solution (Python):

a = int(input())
b = input()
r = "No"

if a%2 == 0:
    c = int(a/2)
    if b[0:c] == b[c:]:
        r = "Yes"

print(r)

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

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

Solution (Python):
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    S = stdin.readline().rstrip()
    if N % 2 != 0:
        print('No')
    else:
        if S[: N // 2] == S[N // 2:]:
            print('Yes')
        else:
            print('No')


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    N = int(input())
    S = input()
    T = S[0:N//2]
    ans = "No"

    if (T*2) == S:
        ans = 'Yes'
    
    print(ans)

if __name__ == '__main__':
    main()

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

if N % 2 == 1:
  ans = "No"
else:
  zenhan = S[0:int(N/2)] 
  kouhan = S[int(N/2):N]
  if zenhan == kouhan:
    ans = "Yes"
  else:
    ans = "No"

print(ans)

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

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

Solution (Python):
def main():
    N = int(input())
    S = input()
    if N % 2 == 0:
        half = N // 2
        for i in range(half):
            A = S[i]
            B = S[i + half]
            if A != B:
                print("No")
                exit()
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys
n = int(input())
s = str(input())
tmp = []
if n%2:
    print('No')
    sys.exit()

for i in range(n):
    if i+1 <= n//2:
        tmp.append(s[i])
    else:
        if tmp[i-n//2] != s[i]:
            print('No')
            sys.exit()
        else:
            continue
print('Yes')

Solution (Python):
n = int(input())
s = input()
s = sorted(s)
ans = True
if(len(s)>1 and len(s)%2 == 0):
    for i in range(0,len(s),2):
        if(s[i] != s[i+1]):
            ans = False
else:
    ans = False
if(ans):
    print("Yes")
else:
    print("No")

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

ans = 'No'

if n % 2 == 0:
  half = n // 2
  a = s[:half]
  b = s[half:]
  
  if a == b:
    ans = 'Yes'

print(ans)

Solution (Python):
n = int(input())
s = input()
if n%2==0:
    num = int(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 == 1:
  print('No')
else:
  if s[:N//2] == s[N//2:]:
    print('Yes')
  else:
    print('No')

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

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

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

print(ans)

Solution (Python):
def f(n, s):
    if n % 2 != 0: return "No"
    p1 = 0
    p2 = n//2
    while p2 < n:
        if s[p1] != s[p2]: return "No"
        p1+=1
        p2+=1
    return "Yes"


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

print(f(n, s))

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

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

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

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

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 = str(input())

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

Solution (Python):
import sys

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

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

else:
    print('No')

Solution (Python):
import sys
N = int(input())
S = input()
M = N // 2

if N % 2 != 0:
  print('No')
  sys.exit()

else:
  for i in range(0,M):
    if S[i] != S[i + M]:
      print('No')
      sys.exit()
    
  print('Yes')

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 




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

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

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

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

Solution (Python):

def answer():
    N = int(input())
    S = input()

    ans = 'No'

    if N % 2 == 0:
        half = N//2
        if S[:half] == S[half:]:
            ans = 'Yes'

    print(ans)


if __name__ == '__main__':
    answer()

Solution (Python):



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

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

s1 = s[0:len(s)//2]
s2 = s[len(s)//2:len(s)]

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

Solution (Python):
n=int(input())
s=input()
a=len(s)
if a%2==1:
  print("No")
else:
  b=a//2
  c=0
  for i in range(b):
    if s[i]!=s[i+b]:
      print("No")
      break
    else:
      c=c+1
  if c==b:
    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:
    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 len(S)%2 == 1:
  print("No")
else:
  if S[:len(S)//2] == S[len(S)//2:]:
    print("Yes")
  else:
    print("No")

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

if len(S) == 1:
  print('No')
  sys.exit(0)
elif len(S) % 2:
  print('No')
  sys.exit(0)
else:
  l = int(len(S) / 2)
  a = S[:l]
  b = S[l:]
  if a == b:
    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()

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

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

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

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

Solution (Python):
n = int(input())
s = input()
print('YNeos'[s != s[:n // 2] * 2 ::2])

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

n = int(input())
s = 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()

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

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

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

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

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

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

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