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):
s = int(input())
a = input()
if s % 2 == 1:
     print('No')
elif ''.join(list(a)[0:int(len(a)/2)]) == ''.join(list(a)[int(len(a)/2):]):
    print('Yes')
else:
    print('No')

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

s = str(input())

m = n // 2

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

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

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

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

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

print('Yes')

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

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

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

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

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

Solution (Python):
n=input()
s=input()
a=[]
b=[]
for i in range(len(s)//2):
    a.append(s[i])
for i in range(len(s)//2,len(s)):
    b.append(s[i])
if a==b:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

num =int(input())
alf =input()
if num%2==1:
  print("No")
  sys.exit()
l=num/2
for i in range(int(l)):
	if not alf[i]==alf[int(l)+i]:
		
		
		print("No")
		sys.exit()
print("Yes")

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

if N % 2 == 0:
  if S[0:int(N/2)] == S[int(N/2):]:
    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=[i for i in input()]
if N%2 == 1:
    print('No')
else:
    S_=S[:N//2]
    if S==S_+S_:
        print('Yes')
    else:
        print('No')

Solution (Python):

N = int(input())
S = input()
ans = ""
if N % 2 == 1:
    ans = "No"
half = N // 2
S1 = S[:half]
S2 = S[half:]

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

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

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

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

S_tuple= S[:T],S[T:]
P=S_tuple[0]
Q=S_tuple[1]
if N%2!=0:
  print("No")
elif P==Q:
  print("Yes")
else:
  print("No")

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

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

st1 = s[:le//2]
st2 = s[le//2:]
if st1 == st2:
  print("Yes")
else:
  print("No")
  exit()

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

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

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

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

Solution (Python):

"""
Spyder Editor

This is a temporary script file.
"""


import sys
n=int(input())
s=input()
if n%2==1:
    print("No")
    sys.exit()
p=s[0:int(n/2)]
if p+p==s:
    print("Yes")
else:
    print("No")

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

if N % 2 != 0:
    print("No")
else:
    print("{}".format("Yes" if S[0:N//2] == S[N//2:] else "No"))

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

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

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

s1 = S[:N//2]
s2 = S[N//2:]

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  

def solve(N: int, S: str):
    if N % 2 != 0:
        print(NO)
        exit()
    
    num = int(N/2)
    if S[:num] == S[num:]:
        print(YES)
    else:
        print(NO)
    return



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

if __name__ == '__main__':
    main()

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

if not n % 2:
  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:
  flag = True
  for i in range(n//2):
    if s[i] != s[n//2+i]:
      flag = False
      
  if flag:
    print('Yes')
  else:
    print('No')
    
else:
  print('No')

Solution (Python):
def solve(string):
    n, s = string.split()
    n = int(n)
    return "Yes" if s[:n // 2] == s[n // 2:] else "No"


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

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

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

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

s_length = len(s)

if s[: s_length // 2] == s[s_length // 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()

err = 0

if N % 2 ==1:
    err = 1
else:
    harf = int(N/2)
    for i in range(harf):
        if S[i] != S[i + harf]:
            err = 1

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

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

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

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

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

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

Solution (Python):


import sys

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

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

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

print("Yes")

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

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

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

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

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

count = len(S)

if count % 2 == 0:
    T = S[: int(count/2)]
    S2 = T + T
    if S2 == S:
        print("Yes")
    else:
        print("No")
else:
    print("No")

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

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

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

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

half=N//2

if S[:half] == S[half:]:
  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):
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

target_len = int(fetch_one_line())
target_str = fetch_one_line()

echo_result = ["Yes", "No"]
IS_REPEAT = 0
ISNT_REPEAT = 1
if target_len % 2 == 1:
    print(echo_result[ISNT_REPEAT])
else:
    half_len = int(target_len / 2)
    if target_str[:half_len] == target_str[half_len:]:
        print(echo_result[IS_REPEAT])
    else:
        print(echo_result[ISNT_REPEAT])

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

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

if len(s) % 2 == 1:
    print("No")
elif s[: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:
  count=0
  for i in range(0,N//2):
    if S[i]==S[i+N//2]:
      count+=1
  if count==N//2:
    print('Yes')
  else:
    print('No')

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


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

Solution (Python):

def main():
    N = int(input())
    S = input().rstrip()
    if N % 2 == 1:
        flg = False
    else:
        flg = S[: N // 2] == S[N // 2 :]
    print("Yes" if flg else "No")


if __name__ == "__main__":
    main()

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

mid = int(N/2)

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

Solution (Python):

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

hN = int(int(N)/2)

S1 = S[:hN]
S2 = S[hN:]

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

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

def main():
    n_half = int(input()) // 2
    s = input().strip('\n')
    if n_half > 0 and s[0:n_half] == s[n_half:]:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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

Solution (Python):
N = int(input())
s = input()
b=''
c=''
for i,d in enumerate(s):
    if i<=(N/2-1):
        b+=d
    else:
        c+=d
if c==b:
    print('Yes')
else:
    print('No')

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

half=int(N/2)

if N%2==0:
    T=S[0:half]
    if S.count(T)==2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

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

half_index = n // 2
right_index = n - half_index

if n == 1 or n % 2 == 1:
    print('No')
elif s[:half_index] == s[right_index:]:
    print('Yes')
else:
    print('No')

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

Solution (Python):

N = int(input())
S = 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:
  print('No')
else:
  m = int(n/2)
  if s[:m] == s[m:]:
    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(input())
if N % 2 == 0:
    count = 0
    for i in range(N//2):
        if S[i] == S[N//2+i]:
            count += 1
    if count == N//2:
        print("Yes")
        sys.exit()
print("No")

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

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

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

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

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

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

i = int(N/2)

if S[:i]*2 == S:
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

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

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

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

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

harf_num = int(input_num / 2)

t_1 = input_str[0: harf_num]
t_2 = input_str[harf_num:]
if t_1 == t_2:
    print("Yes")
else:
    print("No")

Solution (Python):
n=int(input())
hn=n//2
tx=input()
tx1=tx[:hn]
tx2=tx[hn:]

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

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

ans = 'No'

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

Solution (Python):
N = int(input().strip())
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, s = [input() for i in range(2)]

a = int(int(n)/2)

if type(a) is int:
    if s[:a] == s[a:]:
        print("Yes")
    else:
        print("No")

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

    if (N % 2) == 0:
        cnt = N // 2
        s1 = S[:cnt]
        s2 = S[cnt:]

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

ABC145B_Echo()

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

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


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

print("Yes")

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()
flag = 1
if n % 2 == 1:  flag = 0
else:
    hn = n // 2
    for i in range(hn):
        if s[i] != s[i + hn]:   flag = 0

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

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

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

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

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

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

a=N//2
answer="Yes"

if N%2==1:
    print("No")
else:
    for i in range(a):
        if S[i]==S[i+a]:
            pass

        else:
            answer="No"
            break
    print(answer)

Solution (Python):
N = int(input())
S = input()
SS = list(S)
SSS = []
if N%2 != 0:
    print("No")
else:
    for i in range(int(N/2)):
        SSS.append(SS[i])
    SSS = "".join(SSS)
    SSS += SSS
    if SSS == 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):
FLAG = False

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

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

half = int(N / 2)

if FLAG == False :
    for s in S :
        if half < N :
            half = half + 1

        if s is S[half - 1] :
            pass
        else :
            print("No")
            break

        if N == half:
            print("Yes")
            break

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):
i = int(input())
s = input()
n = i // 2
s1 = s[0:n]
s2 = s[n:i]

if((i % 2 == 0)and(s1 == s2)):
    print("Yes")
else:
    print("No")

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

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

if n % 2 == 1:
    print("No")
else:
    c = int(n/2)
    s_1 = s[:c]
    s_2 = s[c:n]

    if s_1 != s_2:
        print("No")
    else:
        print("Yes")

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

print("YNeos"[s[0:int(n/2)] != s[int(n/2):n]::2])

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

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

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

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

Solution (Python):
def solve(s: str) -> bool:
  if len(s) % 2 == 1:
    return False
  if len(s) == 0:
    return True

  i = 0
  j = len(s) // 2
  while i < len(s) // 2:
    if s[i] != s[j]:
      return False
    i += 1
    j += 1
  return True


n = int(input().strip())
s = input().strip()
if solve(s):
  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):
def main():
    N = int(input())
    S = input()

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

    flag = True
    for i in range(int(N/2)):
        if S[i] == S[i + int(N/2)]:
            continue
        flag = False

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

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

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

if(N==2 and S[0]!=S[1]):
    print("No")
    sys.exit()

for x in range(0, N//2-1):
    if(S[x]!=S[N//2+x]):
        print("No")
        sys.exit()

print("Yes")

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

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

Solution (Python):

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

Solution (Python):
n=int(input())
s=input()
if n%2==0:
	if s==s[:n//2]*2:
		print('Yes')
		exit()
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):
import sys

sys.setrecursionlimit(10**7)
N = int(input())
S = input()

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

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

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

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

Solution (Python):


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

def string_match(str):
    length = len(str)
    half = length//2
    fore_str = str[0:half]
    aft_str = str[half:]
    flg = True
    for i in range(0, half):
        if fore_str[i] != aft_str[i]:
            flg = False
            break
    return flg


if n % 2 != 0:
    flg = False
else:
    flg = string_match(s)

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

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

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

center=int(n/2)

if n%2==0 and s[:center] == s[center:]:
  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):
from __future__ import print_function


import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq

def reduce(p, q):
    common = fractions.gcd(p, q)
    return (p//common , q//common )



import random


def main():
    n = int(input().strip())
    S = input().strip()
    eprint(S[0:n//2])
    if n%2!=0:
        print("No")
    else:
        if S[0:n//2]*2==S:
            print("Yes")
        else:
            print("No")
    return

if __name__ == '__main__':
    main()

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

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok



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


main()

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

if n % 2 == 1:
  print("No")
else:
  n2 = n // 2
  if str[0:n2] == str[n2:n]:
    print("Yes")
  else:
    print("No")

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

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

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

flag = 1

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

else:
    n = N//2

    for i in range(n):
        if S[i] != S[n+i]:
            flag = 0
            break

    print("Yes" if flag == 1 else "No")

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

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

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


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

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

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

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

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

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

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

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

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

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

if n%2==1:
  print("No")
else:
  k=n//2
  if(s[0:k]==s[k:n]):
    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):
def samestring():
  N=int(input())
  S=list(input())
  if N % 2 != 0:
    print('No')
  else:
    S1 = S[0:int(N/2)]
    S2 = S[int(N/2):]

    if S1 == S2:
      print('{}'.format('Yes'))
    else:
      print('{}'.format('No'))

samestring()

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

Solution (Python):
from sys import stdin

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

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

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

Solution (Python):

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

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

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