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 == 1):
    print("No")
    exit()
m = N//2
for i in range(m):
    if(S[i] != S[i+m]):
        print("No")
        exit()
print("Yes")

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

Solution (Python):
n=int(input())
s=list(input())
if n%2==0:
    bef=s[:n//2]
    aft=s[n//2:]
    if bef==aft:
        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):

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


def solve():
    N = int(input())
    S = input()
    if N % 2 == 0:
        h = N // 2
        if S[:h] == S[h:]:
            print("Yes")
            return
    print("No")


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

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

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

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

print(ans)

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

ret = "No"
for i in range(N//2):
    s = S[:i+1]

    if s + s == S:
        ret = "Yes"
        break

print(ret)

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

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):
n = int(input())
s = str(input())
if len(s) % 2 == 1:
    print('No')
else:
    t = len(s) // 2
    if s[t:] == s[:t]:
        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=str(input())
d=True

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

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

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

Solution (Python):
n = int(input())
lst = list(input())
count = 0

if n % 2 == 0:
    for i in range(n // 2):
        if lst[i] == lst[i + n // 2]:
            count += 1

if count == n / 2:
    print("Yes")
else:
    print("No")

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

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

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

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

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

def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))

INF=10**20
def main():
    N=ii()
    S=list(input())

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




if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

print('Yes')

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

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

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

flag = False
half = (N+1) // 2
if S[:half] == S[half:N]:
  flag = True
if flag:
  print("Yes")
else:
  print("No")

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

half = (N+1) // 2
if N%2 != 0:
  if S[:half] == S[half+1:N]:
    print("Yes")
  else:
    print("No")
else:
  if S[:half] == S[half: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:]:
  		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()
if(n%2==0):
  s1=s[:n//2]
  s2=s[n//2:n]
  if(s1==s2):
    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 n % 2 == 1:
    print('No')
else:
    cnt = 0
    for i in range(0, n // 2):
        cnt += (s[i] == s[i + n // 2])
    if(cnt == n // 2):
        print('Yes')
    else:
        print('No')

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

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

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

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

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

else :
    for i in range(n//2):
        if s[i] == s[i+n//2]:
            cnt += 1

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

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

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

Solution (Python):

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

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

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

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

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

Solution (Python):


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

len_t = n//2
t = s[0:len_t] * 2

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

Solution (Python):


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

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

Solution (Python):

a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("Yes" if c == d else "No")

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

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

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

        
a=s[:n//2]
b=s[n//2:]

cnt=0
for i in range(n//2):
  if a[i]!=b[i]:
    cnt+=1

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

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

ans = 'No'

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

Solution (Python):
import sys
N = int(input())
S = input()
if N % 2 == 1:
    print('No')
    sys.exit()

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

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 main():
    import sys
    readline = sys.stdin.buffer.readline

    n = int(readline())
    s = readline().rstrip().decode('utf-8')

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

if __name__ == '__main__':
    main()

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

Solution (Python):
N = int(input())
S = input()
if N % 2 != 0:
  print("No")
  exit()
x = int(len(S) / 2)
y = S[0:x]
z = S[x:len(S)]
if y == z:
  print("Yes")
else:
  print("No")

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

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

front = S[:N//2]
latter = S[N//2:]

if front == latter:
    print("Yes")
else:
    print("No")

Solution (Python):
b=int(input())
a=input()
c=[]
for i in range(b):
    c.append(a[i])



if b==1:
    print("No")
elif c[:int(b/2)]==c[int(b/2):]:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

print(("No","Yes")[moji[:int(N/2)] == moji[int(N/2):]])

Solution (Python):
n = int(input())
s = input()
t = s[n//2:]


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

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

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

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

Solution (Python):
n = int(input())
s = 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 len(S) % 2 != 0:
    print("No")
    exit()

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

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

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

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

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

Solution (Python):
input()
s = input()
if len(s) % 2 !=0:
  print('No')
else:
  s1 = s[:len(s)//2]
  s2 = s[len(s)//2:]
  print("Yes" if (s1 == s2) else "No")

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

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

half = n // 2

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

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

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

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

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

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')
YES = "Yes"  
NO = "No"  


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


def main():

    sys.setrecursionlimit(10 ** 6)

    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)  
    print(f'{solve(N, S)}')


if __name__ == '__main__':
    main()

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

Solution (Python):
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

Solution (Python):

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

if a.__eq__(b):
    print("Yes")
    exit()
else:
    print("No")

Solution (Python):
S=int(input())
T=list(input())
t=S//2
p=0
for i in range(t):
    if S%2==1:
        p=-1
        break
    elif T[i]!=T[i+t]:
        p=-1
        break
if p==-1 or t==0:
    print("No")
elif p==0:
    print("Yes")

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

if r%2 == 1:
  print("No")
  exit()
m = str(s[0:r//2])

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

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

Solution (Python):
nn = input()
n = str(input())

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

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

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

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

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

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


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

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

else:
  print("No")

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

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def _S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    N = I()
    S = _S()
    print("Yes" if S[:int(len(S)/2)]==S[int(len(S)/2):] else "No")

main()

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

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

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

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

Solution (Python):
N=int(input())
S=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()
t=""
for i in range(len(s)//2):
    t += s[i]

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

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

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

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

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

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

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

q = input()
a = list(q)

if N % 2 == 1:
  print('No')
  
elif N % 2 == 0:
  b = [a] * int(N/2)
  c = [a] * int(N/2)
  for i in range(int(N/2)):
    b[i] = a[i]
  for j in range(int(N/2)):
    c[j] = a[int(j)+int(N/2)]
  if b == c:
    print('Yes')
  else:
    print('No')

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

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

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

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

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

Solution (Python):
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy


import heapq
sys.setrecursionlimit(10**6)

INF = 10**18
import bisect
import statistics
mod = 10**9+7


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

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

Solution (Python):
n=int(input())
s=input()
r=''
for i in s:
    r+=i
    if(r*2==s):
        print("Yes")
        break
else:
    print("No")

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

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

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

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

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

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

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

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

S = str(input())
mid = N//2
s1 = S[:mid]
s2 = S[mid:]
if s1 == s2:
  print("Yes")
else:
  print("No")

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

Solution (Python):
N = int(input())
S = input().strip()
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()
flag = True if N % 2==0 else False

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

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

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

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