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

n2 = int(n / 2)

sa = s[:n2]
sb = s[n2:]

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

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

f = "";
b = "";

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

Solution (Python):
a = int(input())
b = input()
c = int(a / 2)

d = b[0:c]
e = b[c:]
if d == e:
  print('Yes')
else:
  print('No')

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

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

else:
    count=0
    for i in range(0,int(n/2)):
        if s[i]==s[i+int(n/2)]:
            count=count+1
    if count==int(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=str(input())
nhalf=int(n/2)
shalf=s[0:nhalf]
if s==shalf*2:
  print("Yes")
else:
  print("No")

Solution (Python):




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

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

elif N % 2 == 0:
    mid = N // 2
    is_rep = True

    for i in range(mid):
        if(S[i] != S[mid+i]):
            is_rep = False
            break

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

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

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

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

print('Yes')

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

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

Solution (Python):
strlen = int(input())
if strlen % 2 == 1:
  print("No")
else:
  string = input()
  ans = "Yes"
  halfLen = strlen // 2
  for i in range(halfLen):
    if string[i] != string[i+halfLen]:
      ans = "No"
      break
  print(ans)

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

for i in range(n):
    a=''.join(s[:i+1])
    b=''.join(s[i+1:])
    if a==b:
        print("Yes")
        exit()
print("No")

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

if l %2 == 1:
  print('No')
else:

  t = int(l / 2)


  if (s[0:t] == s[t:l+1]):
    print('Yes')
  else:
    print('No')

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

a = S[0:t]
b = S[t:N]
if a == b:
  print('Yes')
else:
  print('No')

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

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


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

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

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

Solution (Python):
a = int(input())
b = str(input())
if a%2==1:
  print("No")
else:
  c = b[:a//2]
  d = c+c
  if b==d:
    print("Yes")
  else:
    print("No")

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

N = int(input())
S = input().strip()
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()
T = S[0:N//2]
if S == T + T:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    length = int(input())
    input_str = str(input())
    
    if length % 2 == 1:
        print('No')
        return
    
    border = int(length / 2)
    first_half = input_str[:border]
    latter_half = input_str[border:]

    if first_half == latter_half:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

s_list = list(s)
counter = "No"
a_list = []
b_list = []
if n % 2 == 0:
    for i in range(n//2):
        a_list.append(s_list[i])
        b_list.append(s_list[i + n//2])
    if a_list == b_list:
        counter = "Yes"
print(counter)

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

flag = 1

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

Solution (Python):
from sys import stdin


def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return [x for x in mi()]
def si(): return stdin.readline()
z=['Yes', 'No']
n=ii()
f=n%2
a=si()
if not f:
    x=n//2
    for i in range(x):
        if a[i]!=a[i+x]:
            f=1
            break
print(z[f])

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

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

Solution (Python):
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    r = II()

    print(r*r)
    return




def B():
    N = II()
    S = input()
    if len(S) % 2 == 0:
        print('No')
        return
    j=S[N//2]
    p=N//2
    for i in S[:N//2]:
        if i != j:
            print('No')
            return
        p+=1
        j=S[p]

    print('Yes')

    return




def C():
    N = II()
    A = LI()
    B = LI()

    L = []
    count = 0
    for i in range(2, int(sqrt(N)+2)):
        if N % i == 0:
            L.append(N/i)
            count = 1
    if count == 0:
        print(N-1)
    else:
        print(int(L[-1]-2+(N/L[-1])))

    return




def D():

    a, b, x = LI()
    BIG = a*a*b/2
    if x > BIG:
        y = 2*b-(2*x/a/a)
        print(math.degrees(math.atan(y/a)))
    else:
        y = 2*x/a/b
        print(math.degrees(math.atan(b/y)))
    return




def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return




def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    



def solution(S):
    
    N = len(S)

    pass



if __name__ == '__main__':
    B()

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

N = int(input().strip())

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

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

Solution (Python):
def judge(N, S):
    length = len(S)
    if N % 2 == 0 and S[:length//2] == S[length//2:]:
        return 'Yes'

    return 'No'


N = int(input())
S = input()
print(judge(N, S))

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

Solution (Python):
import sys
n = int(input())
s = str(input())
if (n % 2 != 0):
    print('No')
    sys.exit()
h = int(n / 2)
if (s[:h] == s[h:]):
    print('Yes')
else:
    print('No')

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

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

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


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

    half_length = n // 2

    if s[:half_length] == s[half_length:]:
        return 'Yes'

    return ' No'


print(solve())

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

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

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

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

Solution (Python):

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

if n%2 == 1:
    print('No')
else:
    ans = 'Yes'
    s1 = s[0:int(n/2)]
    s2 = s[int(n/2):n]
    for i in range(int(n/2)):
        if s1[i] != s2[i]:
            ans  = 'No'
    print(ans)

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

s = N//2

check = S[s:].replace(S[:s],"")
if check:
    print("No")
else :
    print("Yes")

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

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

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

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

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

Solution (Python):

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


halfN = int(N/2)
seq = ""

for i in range(2):
    for j in range(halfN):
        seq = seq + S[j]
        

if seq == S:
    print("Yes")
else:
    print("No")

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

t = int(n/2)

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

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

d, a = divmod(N, 2)
if a == 0 and S[:d] == S[d:]:
    print("Yes")
else:
    print("No")

Solution (Python):



def solve(*args: str) -> str:
    _, s = args
    m = len(s)//2
    return 'Yes' if s[:m] == s[m:] else 'No'


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Solution (Python):
N = int(input())
S = list(input())
ans = "No"
first = ""
latter = ""
if N % 2== 0:
    for i in range(0,N//2):
        first += S[i]
    for j in range(N//2,N):
        latter += S[j]
    if first == latter:
        ans = "Yes"
        
print(ans)

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

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

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

s = input()

s_list = list(s)
flag = True
if n % 2 == 1:
    print('No')
    flag = False

if flag:
    if "".join(s_list[:int(n/2)]) == "".join(s_list[int(n/2):]):
        print('Yes')
    else:
        print('No')

Solution (Python):
def main():
    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")



if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
n=int(input())
s=list(str(input()))
if n % 2 ==0:
    ans=0
    for i in range(n//2):
        if s[i]==s[n//2+i]:
            ans+=1
        else:
            ans+=0

    if ans==n//2:
        print('Yes')
    else:
        print('No')   

else:
    print('No')

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

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

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

Solution (Python):
i = int(input())
s = str(input())
i2=int(i/2)

if i%2 != 0:
    print("No")
elif s[0:i2]==s[i2:i2*2]:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

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




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

l = list(S)






if l[0:int(len(l) /2)] == l[int(len(l) / 2):]:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
import sys
N=int(input())
S=str(input())
tmp=[]
s=list(S)
tmpl=N


if N==1 or N%2!=0:
    print('No')
    sys.exit()
else:
    for i in range(int(N/2)):
        tmp.append(s[i])
tmp2=''
tmp2=''.join(tmp)
if tmp2+tmp2==S:
    print('Yes')
elif N!=0 or N&2==0:
    print('No')

Solution (Python):
a = int(input())
b = input()
c = list(b)
if a % 2 != 0:
  d = "No"
else:
  e = c[:a//2]
  f = c[a//2:]
  if e == f:
    d = "Yes"
  else:
    d = "No"
print(d)

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

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

    n1 = S[: N // 2]
    n2 = S[N // 2 :]

    if n1 == n2:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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


half = int(a/2)

sento = b[0:half]
kouho = b[half:]

if(sento == kouho):
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
from sys import stdin
lines = stdin.readlines()

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

if N%2 == 0 :
  N2 = int(N / 2)
  N3 = int(N / 2 + 1)
  T1 = S[0:N2]
  T2 = S[N2:N]
  if T1 == T2 :
    print("Yes")
  else:
    print("No")
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()
k = int(n/2)

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

Solution (Python):
import numpy as np
input1 = list(map(int,input().split()))
input2 = input()

N = input1[0]
S = input2

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

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

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

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

Solution (Python):
n=int(input())
text=str(input())
half=int(n/2)
text1 = text[0:half]
text2 = text[half:n]
if text1 == text2:
  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, S = int(input()), input()
print("NYoe s"[S[N//2:]==S[:N//2]::2])

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

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

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

Solution (Python):
a=[]
b=0
c=[]
d=[]
i=0
b=int(input())
aa=input()
for x in aa:
    a.append(x)
if len(a)%2==1:
    print("No")
else:
    while i<len(a)//2:
        c.append(a[i])
        i+=1
    while i<len(a):
        d.append(a[i])
        i+=1
    if c==d:
        print("Yes")
    else:
        print("No")

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

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

Solution (Python):

from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def solve():
    n = II()
    s = S()
    if s[: n // 2] == s[n // 2 :]:
        print("Yes")
    else:
        print("No")
    return



if __name__ == '__main__':
    solve()

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

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

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

Solution (Python):
def hantei_s(n, string_a):
    midle = int(n / 2)
    
    if string_a[0:midle] == string_a[midle:]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    n = int(input())
    string_a = input()
    hantei_s(n, string_a)

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

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

s_1 = s[0:(n/2)]
s_2 = s[(n/2):]


if s_1 == s_2:
    print 'Yes'
else:
    print 'No'

Solution (Python):
m = input()
n = input()
M = int(m)
b = M % 2
if b == 1:
    print("No")
else:
    c = M / 2
    d = int(c)
    if n[:d] == n[d:]:
        print("Yes")
    else:
        print("No")

Solution (Python):
m = input()
n = input()
M = int(m)
b = M % 2
if b == 1:
    print("No")
else:
    c = M / 2
    d = int(c)
    if n[:d] == n[d:]:
        print("Yes")
    else:
        print("No")

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

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

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

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

Solution (Python):
N = int(input())
S = list(input())
def echo(S,N):
    if N % 2 != 0:
        return "No"
    else:
        for i in range(0,N//2):
            if S[i] != S[i + (N//2)]:
                return "No"
        return "Yes"
print(echo(S,N))

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

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

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

count = 0

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

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

Solution (Python):
inputbox1 = input()
inputbox2 = input()

N = int(inputbox1)
box = list(inputbox2)
count = 0
if (N%2 == 1):
    print("No")
else:    
    harf = int(N/2)
    for i in range (0,harf):
        if box[i]==box[i+harf]:
            count = count + 1
    
    if count == harf:
        print("Yes")
    else:
        print("No")

Solution (Python):
import os
import numpy as np

class getStdin(object):
    @classmethod
    def get_int(cls):
        return int(input())

    @classmethod
    def get_str(cls):
        return str(input())

class funcCls(object):
    @classmethod
    def done(cls, n, s):
        l = len(s) // 2
        mm = s[0:l]
        if s == mm + mm:
            print('Yes')
        else:
            print('No')

        return


if __name__ == '__main__':
    n = getStdin.get_int()
    s = getStdin.get_str()
    funcCls.done(n, s)

    os.sys.exit(0)

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

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

Solution (Python):
N=int(input())
S=str(input())
n=int((N/2))
if N%2==0:
    mae=S[0:n]
    ato=S[n:]

    if mae==ato:
        print("Yes")
    else:
        print("No")
else:
    print("No")

Solution (Python):
import math

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

if n%2 ==1:
    print("No")
elif s[0:math.ceil(n/2)] == s[math.ceil(n/2):n]:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):

N=int(input())

S=input()

div=N/2

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

Solution (Python):

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

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

Solution (Python):
n = int(input())
s = input()
output = "No"

if n % 2 != 0:
    print(output)

else:
    tmp = s[: n // 2 :]
    if tmp * 2 == s:
        output = "Yes"

    print(output)

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

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

Solution (Python):
import sys

def main():
  N = int(input())
  S = list(input())
  if len(S) % 2 == 1:
    print('No')
    sys.exit()
  else:
    half = int(N / 2)
    for i in range(half):
      if S[i] != S[half + i]:
        print('No')
        sys.exit()
  print('Yes')

main()

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

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

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

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

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

Solution (Python):
def b():
    n = int(input())
    s = input()
    if n % 2 != 0:
        print("No")
        return

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

if __name__ == '__main__':
    b()

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

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

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

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

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

Solution (Python):
n = int(input())
n //= 2
str = input()
sStart,sLast = str[:n],str[n:]

if sStart == sLast :
  print("Yes")
else :
  print("No")

Solution (Python):
def main(n, s):
    if n % 2 != 0:
        print("No")
        return

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

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

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

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

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

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

Solution (Python):
len = int(input())
string = input()
HS = 0

for i in range(len):
	if len - HS <= i:
		break
	HS+=1

if string[:HS] == string[HS:]:
	print("Yes")
else:
	print("No")

Solution (Python):
a=int(input())
b=input()
C=''
d=''
if(a != int(a/2)*2):
    print('No')
else:
    e=int(a/2)
    c = b[:e]
    d = b[e:]
    if(c==d):
        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()

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

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

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

Solution (Python):
import numpy as np

n = int(input())
s = [i for i in input()]

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

Solution (Python):
N = int(input())
S = input()
if(N % 2 == 0 and 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")
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 == 1:
    print("No")
    exit()
m = int(n/2)
a = s[:m]
b = s[m:]
if a == b:
    print("Yes")
else:
    print("No")

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

SS = list(S)

NN = N // 2

count = 0

if N % 2 == 1:
    print('No')
else:
    for i in range(NN):
        if SS[i] != SS[i+NN]:
            count += 1
            print('No')
            break
    if count == 0:
        print('Yes')

Solution (Python):

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

t_num = int(n / 2)

t = s[:t_num]

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

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

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

tlen = N // 2

if S[:tlen] == S[tlen:]:
  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):
a = int(input())//2
b = list(input())

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

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