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

Solution (Python):
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
  if count > (n/2):
    a.append(i)
  else:
    b.append(i)
  count += 1
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(0,int(N/2)):
    a = S[i]
    b = S[int(i+(N/2))]
    if a != b :
      Flag = False
if Flag == True:
  print('Yes')
elif Flag == False:
  print('No')

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

Solution (Python):
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


def main():
	n = int(input())
	s = input()[:-1]
	if(n%2==1):
		print('No')
		return
	print('Yes' if s[:n//2]==s[n//2:] else 'No')

def factorization(n):
	if n<2:
		return []

	arr = []
	temp = n
	for i in range(2, int(-(-n**0.5//1))+1):
		if temp%i==0:
			cnt=0
			while temp%i==0:
				cnt+=1
				temp //= i
			arr.append([i, cnt])

	if temp!=1:
		arr.append([temp, 1])

	if arr==[]:
		arr.append([n, 1])

	return arr

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

	for k in range(2, int(math.sqrt(n)) + 1):
		if n % k == 0:
			return False

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(numbers):
	return reduce(fractions.gcd, numbers)

def lcm(numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

class PriorityQueue():
	def __init__(self):
		self.queue = []
	def push(self,i):
		heapq.heappush(self.queue,-i)
	def pop(self):
		return -1 * heapq.heappop(self.queue)
	def sum(self):
		return -sum(self.queue)

main()

Solution (Python):
N = int(input())
S = input()
sList = list(S)
s1 = ""
s2 = ""
halfN = int(N / 2)
if N % 2 == 0:
    for i in range(halfN):
        s1 = s1 + sList[i]
        s2 = s2 + sList[halfN + i]
    if s1 == s2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Solution (Python):
n = int(input())
s = input()
n = (n+1)//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:
  x = n//2
  ans = True
  for i in range(x):
    if(s[i] != s[x+i]):
      ans = False
  if(ans):
    print("Yes")
  else:
    print("No")

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

else:
    print("No")

Solution (Python):
N = int(input())
S = input()
S_list = list(S)
if N%2 == 0:
    first_s = ','.join(S_list[0:int(N/2)]) 
    last_s =  ','.join(S_list[int(N/2):int(N)]) 
    if first_s == last_s:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
N = int(input())
words = list(input())
if(len(words) % 2 == 1 ):
    print("No")
else:
    center = int(len(words) / 2)
    words_f = words[:center]
    words_b = words[center:]
    if(words_f == words_b):
        print("Yes")
    else:
        print("No")

Solution (Python):
N=int(input())
S=input()
if N%2!=0:
  print("No")
else:
  half=N//2-1
  T1=[]
  T2=[]
  for i in range(half+1):
    T1.append(S[i])
  for j in range(half+1,len(S)):
    T2.append(S[j])
  if T1==T2:
      print("Yes")
  else:
      print("No")

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

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

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

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

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

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

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

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

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

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

hoge = list(S)
fuga = []
for i in range(0, int(N) // 2):
    fuga.append(hoge[i])

if ''.join(fuga) + ''.join(fuga) == S:
    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()
print("YNeos"[s[:n//2]*2!=s::2])

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

Solution (Python):
def main():

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

    if n%2 == 1:
        return 'No'
    
    if s[:n//2] == s[n//2:]:
        return 'Yes'
    return 'No'

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

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

Solution (Python):

N = int(raw_input())
S = raw_input()

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

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 = [i for i in 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 = input()
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
row = input()
unit1, unit2 = row[:len(row)//2], row[len(row)//2:]
if unit1 == unit2:
    print('Yes')
else:
    print('No')

Solution (Python):
n = int(input())
t = [i for i in input()]

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

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

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

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

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

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

Solution (Python):
a = int(input())
b = str(input())
 
if (a%2)==1:
  print('No')
elif b[0:int(a/2)]==b[int(a/2):]:
    print('Yes')
else:
  print('No')

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

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

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

Solution (Python):
import sys


def main():
    [n, s] = [x for x in sys.stdin]
    n = int(n)
    if n % 2 != 0:
        print("No")
        return

    half = int(n / 2)

    if s[0:half] == s[half:n]:
        print("Yes")
        return

    print("No")


main()

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

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

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

Solution (Python):


n = int(input().rstrip())
s = list(input())

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

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

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

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

half = int(N/2)

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

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

left = ""
right = ""

if n % 2 == 1:
    print("No")
else:
    for i in range(0, int(n / 2)):
        left += s[i]
    for j in range(int(n / 2), n):
        right += s[j]
    
    if left == right:
        print("Yes")
    else:
        print("No")

Solution (Python):
N = int(input())
S = str(input())
 
if N + 2 // 2 == 1:
    print('No')
 
else:
    f = int(N/2)
    b = int(N/2)
    front = S[:f]
    back = S[b:]
    if front == back:
        print('Yes')
    else:
        print('No')

Solution (Python):
N,S=int(input()),input();print("NYoe s"[S[:N//2]==S[N//2:]::2])

Solution (Python):
N,S=int(input()),input();print("NYoe s"[N%2==0and S[:N//2]==S[N//2:]::2])

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

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

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

Solution (Python):
n = int(input())
s = input()
if not n%2:
  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")
  exit()

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

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

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

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

Solution (Python):
if __name__ == '__main__':
	n = int(input())
	S = input()

	if n % 2 == 1:
		print("No")
	else:
		m = n // 2
		if S[0:m] == S[m:]:
			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())
l = list(input())
a =0
if n%2 == 0:
  m = int(n/2)
  for i in range(m):
    if l[i] != l[i+m]:
      a = 1
else:
  a = 1

if a == 0:
  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):
n=int(input())
s=input()

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

Solution (Python):
n = int(input())
s = input()
if n % 2 == 1:
  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 == 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()
if n%2:
  print("No")
else:
  if s[:n//2]*2 == s:
    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):
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

n = ni()
s = input()

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

Solution (Python):
def echo(n,s):
  if n % 2 != 0:
    pass
  else:
    if s[:int(n/2)] == s[int(n/2):]:
      return "Yes"
  return "No"

print(echo(int(input()),input()))

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

print(ans)

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

n = int(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:
    n = N // 2

    for i in range(n):
        if S[i] != S[n+i]:
            print("No")
            break
        
        elif i == n-1:
            print("Yes")

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

if N % 2 == 1:
  print("No")
  exit(0)
  
for n in range(int(N/2)):
  if S[n] != S[n + int(N/2)]:
    print("No")
    exit(0)
    
print("Yes")

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

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

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

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

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

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

    


if __name__ == '__main__':
    main()

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())
if n%2==1:
  print("No")
  exit()
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 == 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 == 1:
  print("No")
else:
  N_2 = N//2
  if S[:N_2]==S[N_2:]:
    print("Yes")
  else:
    print("No")

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

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

s = str(input())

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


YES = "Yes"  
NO = "No"  


def solve(N, S):
    if N % 2 != 0:
        return False

    for i in range(N // 2):
        if S[i] != S[i + N // 2]:
            return False
    return True


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


    if solve(N, S):
        print(YES)
    else:
        print(NO)

if __name__ == '__main__':
    main()

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

def no():
    print("No")
def yes():
    print("Yes")
    

n=int(input().rstrip())
s=input().rstrip()


if n%2==1:
    no()
    sys.exit()
m=n//2
for i in range(m):
    if s[i]!=s[i+m]:
        no()
        sys.exit()
yes()

Solution (Python):
import sys

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

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

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

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

count=0
if N%2!=0 or N==1:
    print('No')
else:
    for i in range(int(N/2)):
        if s[i] != s[i+int(N/2)]:
            count+=1
        else:
            count=count

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

Solution (Python):
n = int(input())
s = input()
if n%2 != 0 or n == 1:
  print("No")
elif s[:int(n/2)] == s[int(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[0:n]==s[n:] else "No")

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

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

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

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

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

Solution (Python):
import sys


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


if __name__ == '__main__':
    solve()

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 = list(input())
 
if N%2 == 1:
    print("No")
    exit()
 
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 = list(input())
half = int(N / 2)
a = []
b = []

for i in range(half):
  a.append(S[i])
  b.append(S[i + half])
  
if(N % 2 != 0):
  ans = 0
else:
  if(a == b):
    ans = 1
  else:
    ans = 0

if(ans == 1):
  print("Yes")
else:
  print("No")

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

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

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

if N%2 != 0:
  print('No')
else:
  is_echo=True
  
  for i in range(int(N/2)):
    if S[i] != S[i+int(N/2)]:
      is_echo=False
      
  if is_echo:
    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):
from sys import exit

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

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

Solution (Python):
n = int(input())
s = [str(x) for x in input()]
if n % 2 == 1:
    print('No')
else:
    a = int(n/2)
    if s[0:a] == s[a:]:
        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==1:
  print("No")
else:
  t1=s[:n//2]
  t2=s[n//2:]
  if t1==t2:
    print("Yes")
  else:
    print("No")

Solution (Python):

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

Solution (Python):

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

if n % 2 == 0 and n == len(s):
    m = int(n / 2)
    if s == s[:m] + s[:m]:
        print('Yes')
    else:
        print('No')
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=list(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")
else:
    
    hanbun = int(n/2)
    if s[:hanbun] == s[hanbun:]:
        print("Yes")
    else:
        print("No")

Solution (Python):



N = int(input())

S = input()

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

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

Solution (Python):
_ = input()
s = input()
mid = int((len(s)+1)/2)
if s[:mid] == s[mid:]:
    print("Yes")
else:
    print("No")

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

a = s[0:int(n/2)]
b = s[int(n/2):]

if n % 2 != 0 or n != len(s):
    print("No")
elif a == b:
    print("Yes")
else:
    print("No")

Solution (Python):
n = int(input())
s = input()
a = int(n/2)
if len(s) == n:
    if s[:a] == s[a:]:
        print("Yes")
        exit()

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):
n  = int(input())
s=input()
judge = "Yes"
half = n//2
if n%2 == 1:
    judge = "No"
else:
    for i in range(half):
        if s[i] == s[i+half]:
            pass
        else:
            judge = "No"
            break
print(judge)

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):
def main():
    N = int(input())
    S = input()
    if len(S)!=N or len(S)==1:
        print("No")
    else:
        index = len(S)/2
        half1 = S[:int(index)]

        half2 = S[int(index):]

        if half1 == half2:
            print("Yes")
        else:
            print("No")

if __name__ == "__main__":
    main()

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

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

Solution (Python):
import math
import heapq
import sys
from collections import Counter




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

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

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

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

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

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

Solution (Python):
def main():
    N = int(input())
    S = input()
    q, r = divmod(N, 2)
    if r == 0 and S[:q] == S[-q:]:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

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

Solution (Python):
input = [input() for i in range(2)]
N=int(input[0])
S=input[1]
s1=len(S)//2
s2=len(S)

if len(S)%2!=0:
    print('No')
else:
    if S[0:s1]==S[s1:s2]:
        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):
import sys
N = int(input())
S = str(input())
if N%2==1:
    print("No")
    sys.exit(0)
partial_N = S[0:int(N/2)]
if S == partial_N + partial_N:
    print("Yes")
else:
    print("No")

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

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

a = len(s)
b = a // 2

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

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

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

Solution (Python):
N=int(input())
S=input()
n=int(N/2)
if N%2==1:
    print("No")
else:
    s_1=S[0:n]
    s_2=S[n:N]
    if s_1==s_2:
        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())
S = input()
harf = int(N/2)
if N % 2 != 0:
    print("No")
else:
    if S[0:harf] == S[harf:]:
        print("Yes")
    else:
        print("No")

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

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

h = len(s) / 2

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

Solution (Python):

I=int(raw_input())
S=raw_input()

T1=S[:I/2]
T2=S[I/2:]

if T1 == T2:
    print 'Yes'
else:
    print 'No'

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

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

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