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

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

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

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

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

n = int(N/2)
S1 = S[:n]
S2 = S[n:]

if N % 2 == 1:
    print("No")
else:
    if S1 == S2 :
        print("Yes")
    else:
        print("No")

Solution (Python):
input()
l = input()
print("NYoe s"[l[0:int(len(l)/2)] == l[int(len(l)/2):len(l)]::2])

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):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
S = read().decode('utf8').rstrip()






flag = False
if N % 2 == 0:
    M = N // 2
    flag = S[:M] == S[M:]

ans = 'Yes' if flag else 'No'
print(ans)

Solution (Python):
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
S = read().decode('utf8').rstrip()





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

Solution (Python):
input = [input() for i in range(2)]
n = int(input[0])
s = input[1]

if(n % 2 != 0):
  print('No')
elif(n != len(list(s))):  
  print('No')
else:  
  s_list = list(s)
  num = n/2
  s1 = s_list[:int(num)]
  s2 = s_list[int(num):]

  if(len(s1) != len(s2)):
    print('No')    
  else:  
    flag = True  
    for index in range(len(s1)):
      if(s1[index] != s2[index]):
        flag = False

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

Solution (Python):
import sys


def solve(inp):
    N = int(inp.readline().strip())
    S = inp.readline().strip()

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


def main():
    result = solve(sys.stdin)
    if result:
        print(result)


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    n = int(input().rstrip('\n'))
    s = str(input().rstrip('\n'))
    if n % 2 == 0:
        if s[:n // 2] == s[n//2:]:
            print("Yes")
        else:
            print("No")
    else:
        print("No")


if __name__ == '__main__':
    solve()

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

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

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

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

l = int(len(s)/2)
a = ""
b = ""

for i in range(l):
  a += s[i]
  b += s[i+l]
  
if a==b:
  print("Yes")
else:
  print("No")

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

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

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

Solution (Python):
n = int(input())
s = input()
if n%2 == 1:
    print('No')
else:
    t1 = s[0:n//2]
    t2 = s[n//2:n]
    if t1 == t2:
        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):
def solve():
    n = int(input())
    data = input()
    
    n = int(n)
    if data[:n//2] == data[n//2:]:
        return "Yes"
    return "No"

if __name__ == "__main__":
    
    
    print(solve())

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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        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 n%2!=0 :
    print("No")
elif s[:n//2]+s[:n//2] == s:
    print("Yes")
else:
    print("No")

Solution (Python):
a = int(input())
b =  input()

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

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

if N%2==1:
    print("No")
else:
    m=int(N/2)
    s1=s[:m]
    s2=s[m:]
    if  s1==s2:
        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 = str(input())

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

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

Solution (Python):



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

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

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

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

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

n = readi()
t = list(read())
if n % 2 == 1:
    print("No")
else:
    t1 = ""
    t2 = ""
    for i in range(n // 2):
        t1 += t[i]
        t2 += t[i + n // 2]
    if t1 == t2:
        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] ==S:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = int(input())
S = input()
h = N//2
T = S[0:h:]
if(S == T + T):
	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 != 0:
    res = 'No'
else:
    if S[:len(S)//2] == S[len(S)//2:]:
        res = 'Yes'
    else:
        res = 'No'


print(res)

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
bbn=1000000007
	


def is_ok(n,s):
	if n % 2 ==1:
		return False
	for ti,tj in zip(s[:(n//2)],s[(n//2):]):
		
		if ti != tj:
			return False
	return True
	
def main():
	n = int(input())
	s = input()
	ret = 'Yes' if is_ok(n,s) else 'No'
	print(ret)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

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 != 0:
    print('No')
    exit()

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

print('Yes')

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()
print("Yes") if s[:n//2] == s[n//2:] else print("No")

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

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

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

s2 = input()

r4 = "Yes"
if n1 % 2 == 1:
    r4 = "No"
for i3 in range(n1 // 2):
    if s2[i3] != s2[i3 + (n1 // 2)]:
        r4 = "No"

print(r4)

Solution (Python):
_ = input()
text = input()

if text[:len(text) // 2] == text[len(text) // 2:]:
  print("Yes")
else:
  print("No")

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

if s == s[:l//2] + s[:l//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 s[:n//2] == s[n//2:] and n%2 == 0:
    result = 'Yes'
else:
    result = 'No'
print(result)

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

ans = "No"

center = N//2

a1 = "".join(S[:center])
a2 = "".join(S[center:])

if a1 == a2:
    ans = "Yes"

print(ans)

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

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

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

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

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

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

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

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

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


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

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


if N % 2 == 0:
    S1 = S[:int(N / 2)]
    S2 = S[int(N / 2):]

    if S1 == S2:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
import numpy as np
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

ans = 0
n = inp()
s = input()

ls = len(s)
if s[:ls//2] == s[ls//2:]:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

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

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

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

Solution (Python):
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
import math
sys.setrecursionlimit(200000)
input = sys.stdin.readline

N, = map(int, input().split())





S = input().strip()

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[:n//2] == s[n//2:]:
  print('Yes')
else:
  print('No')

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

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

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()
s1 = s[0:n//2]
s2 = s[n//2:]
if s1==s2:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
def ints():
  return [int(x) for x in input().split()]
def readi():
  return int(input())

n = readi()
s = input()

def no():
  print('No')
  exit()

if n%2>0:
  no()

for i in range(0, n//2):
  if s[i]!=s[i+n//2]:
    no()

print('Yes')

Solution (Python):
n = int(input())
s = list(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()

med = n // 2

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

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

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

Solution (Python):
def main():
	
	n = int(input())
	s = str(input())
	
	
	
	if s[:(int(n/2))] + s[:int(n/2)] == s:
		print("Yes")

	else:
		print("No")


if __name__ == '__main__':
	main()

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

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

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

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

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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(N: int, S: str):
    if S[:N//2] == S[N//2:]:
        print(YES)
    else:
        print(NO)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    S = next(tokens)  
    solve(N, S)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
N = int(input())
S = str(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==1:
    ans="No"
else:
    if all(S[i]==S[i-N//2] for i in range(N//2)):
            ans="Yes"
    else:
        ans="No"
print(ans)

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

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

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

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

if(length % 2 == 1):
    print('No')
else:
    key = 0
    for i in range(length // 2):
        if(string[i] != string[length//2 + i]):
            key = 1

    if(key == 0):
        print('Yes')
    else:
        print('No')

Solution (Python):
N=int(input())
S=list(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=input()
  n=len(S)
  T=S[0:n//2]
  if n%2==0:
    if S==T+T:
      print("Yes")
    else:
      print("No")
  else:
    print("No")
main()

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

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

t1 = s[:n//2]
t2 = s[n//2:]

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

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

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

if n % 2 == 0:
    s1 = s[:n//2]
    s2 = s[n//2:]
    if s1 == s2:
        print("Yes")
    else:
        print("No")
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()
print('YNeos'[s[:n//2]!=s[n//2:]::2])

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

Solution (Python):


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

if n%2 == 0:
    m = n//2

    if s[:m] == s[m:]:
        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[0:n//2]==s[n//2:]):
  print("Yes")
else:
  print("No")

Solution (Python):
a = int(input())
b = list(input())
p=len(b)
c = b[p//2:]
d = b[:p//2]
if c == d:
  print('Yes')
else:
  print('No')

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

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

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

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

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

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

ans = 'No'
if N%2 == 0:
    first_half = S[:N//2]
    latter_half = S[N//2:]
    if first_half == latter_half:
        ans = 'Yes'

print(ans)

Solution (Python):
N = int(input())
S = input()
s1 = list()
s2 = list()
if N % 2 == 1:
    print("No")
else:
    for i in range(N//2):
        s1.append(S[i])
    for i in range(N//2,N):
        s2.append(S[i])
    if s1 == s2:
        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()

n_2 = int(n/2) 

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 s[:n//2] == s[n//2:]:
  print("Yes")
else:
  print("No")

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

if N%2 > 0:
  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())
s = list(input())

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

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

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

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

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

Solution (Python):
import sys
import itertools
import bisect
import math
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

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

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

Solution (Python):
n=int(input())
s=input()
a=s[:n//2]
b=s[n//2:]
print("Yes" if a==b else "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")
else:
    if s[:len(s)//2] == s[len(s)//2:]:
        print('Yes')
    else:
        print('No')

Solution (Python):
N = int(input())
S = input()
S1 = []
if N % 2 != 0:
    print('No')
    exit()
for i in range(N // 2):
    S1.append(S[i])

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

Solution (Python):
def run():
  N = int(input())
  S = input()
  if N%2 == 0:
    N //= 2

    T = S[0:N]
    if T == S[N:]:
      print('Yes')
      exit()
  print('No')
  
if __name__ == '__main__':
  run()

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

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

Solution (Python):
N = int(input())
S = input()
li = list(S)
n = int(len(li)/2)
half_li = list()
for i in range(n):
	half_li.append(li[i])
T = ''.join(half_li)
if S == T*2:
	print('Yes')
else:
	print('No')

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


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

elif m[:int(n/2)] == m[int(n/2):]:
    print("Yes")
else:
    print("No")

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

if length==1:
    print("No")
elif length%2!=0:
    print("No")
else:
    a=''
    b=''

    for i in range(length//2):
        a+=c[i]
        b+=c[length//2 + i]

    if a==b:
        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[N//2+i]:
      print('No')
      exit()
  print('Yes')

Solution (Python):
input_num = int(input())
input_str = str(input())

if input_num % 2 == 0 and input_str[:input_num//2] == input_str[input_num//2:]:
    print ("Yes")
else:
    print ("No")

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

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

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

flag = True
if n % 2 == 1:
    flag = False

for i in range(n//2):
    if s[i] != s[i + (n//2)]:
        flag = False
        break

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

Solution (Python):
n = int(input())
s = input()
one = ''
two = ''


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

else:
  for i in range(int(n/2)):
    one += s[i]
    two += s[i+int(n/2)]
  
  if one == two:
    print('Yes')
  else:
    print('No')

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

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

Solution (Python):
N = int(input())
S = input()
a = S[0:N//2]
b = S[N//2:N]
if a == b:
    print('Yes')
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()
ans = 'Yes' if S[:N//2]==S[N//2:] else 'No'
print(ans)

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

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 == 0 and 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:
  print('No')
else:
  s1 = s[:n//2]
  s2 = s[n//2:]
  if s1 == s2:
    print('Yes')
  else:
    print('No')

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

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

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

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

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()

if n%2 != 0:
    print('No')
else:
    for a,b in zip(s[0:],s[int(len(s))//2:]):
        if a == b:
            pass
        else:
            print('No')
            break
    else:
        print('Yes')

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

if S[0:N//2]*2== 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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    if(n&1):
        print("No")
        return

    S=input()
    print("Yes" if(S[:n//2]==S[n//2:]) else "No")
resolve()

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

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

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()
if N%2==1:
    print("No")
else:
    center = int(len(S)/2)
    if S == S[:center]*2:
        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()
judge = 'Yes'
if n % 2 == 0:
    for i in range(int(n/2)):
        if s[i] != s[i + int(n/2)]:
            judge = 'No'
else:
    judge = 'No'
print(judge)

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

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

even =n//2

a = s[:even]
b = s[even:]

if a==b:
    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()

n = N // 2

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

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

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

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

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

print("Yes")

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

Solution (Python):
N, *D, = [s.split() for s in open(0)]
N = int(N[0])
D = D[0][0]
if N%2 != 0:
    print("No")
elif N%2 == 0 and D[:int(N/2)] == D[int(N/2):]:
    print("Yes")
else:
    print("No")

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

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

if n % 2 == 1:
    print("No")
elif "".join(s[:int(n / 2)]) == "".join(s[int(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):
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 != 0):
  print("No")
else:
  flag = 0
  for i in range(n//2):
    if(s[i]!=s[i+n//2]):
      flag = 1
      break
  if(flag):
    print("No")
  else:
    print("Yes")

Solution (Python):
N = int(input())
S = input()
S_list = list(S)
a = N // 2

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