Problem:
 Score : 200 points    Problem Statement Given are a positive integer N and a string S of length N consisting of lowercase English letters.  Determine whether the string is a concatenation of two copies of some string.
That is, determine whether there is a string T such that S = T + T .      Constraints  1 \leq N \leq 100  S consists of lowercase English letters.  |S| = N         Input Input is given from Standard Input in the following format:  N  S       Output If S is a concatenation of two copies of some string, print Yes ; otherwise, print No .        Sample Input 1 6
abcabc      Sample Output 1 Yes  Let T =  abc , and S = T + T .       Sample Input 2 6
abcadc      Sample Output 2 No       Sample Input 3 1
z      Sample Output 3 No

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

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

Solution (Python):
n = int(input())
s = input()
ans = 'No'

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

print(ans)

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

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

T = S[:int(len(S)/2)]

S_alt = T + T

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

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

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

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

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

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

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


ans="Yes"
for i in range(len(s)//2):
    if s[i]!=s[i+len(s)//2]:
        ans="No"
        break

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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


def some(s):
    a, b = s[:n//2], s[n//2:]
    if n % 2 or a != b: return "No"

    return "Yes"


print(some(s))

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

ans="No"
if n%2==0:
    p=n//2
    if s[:p]==s[p:]:
        ans="Yes"

print(ans)

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

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

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

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

if N % 2 == 0:
  n = N // 2
  s = S[0:n]

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

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

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

if (n % 2 == 0) and (s[:h] == s[h:]):
  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()

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

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

    cond = S[:N // 2] == S[N // 2:]

    print('Yes' if cond else 'No')


if __name__ == '__main__':
    main()

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

Solution (Python):
N = int(input())
S = list(input())
ans = 'No'
if N%2 == 0:
  num = int(N/2)
  pre = S[:num]
  suf = S[num:]
  if pre == suf: ans = "Yes"
print(ans)

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

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

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

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

if N % 2 == 1:
    print("No")
else:
    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):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import product, combinations,permutations
from copy import deepcopy
import sys
sys.setrecursionlimit(4100000)



if __name__ == '__main__':
    N = int(input())
    S = input()

    mid = N // 2

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

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

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

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

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

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

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

if n == 1:
    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 == 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):
    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()

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

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

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

t1=a[0:int(n/2)]
t2=a[int(n/2):n]

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

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

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

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

for i in range(1, n):
    if s[0] == s[i] and s[:i] == s[i:]:
        print("Yes")
        break
else:
    print("No")

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

ret = False
if N % 2 == 0:
  S = input()
  if S[:N//2] == S[N//2:]:
    ret = True

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

Solution (Python):
















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    S = lines[1]
    N = int(lines[0])
    
    
    
    
    
    
    
    
    

    if N % 2 != 0:
        result = 'No'
    else:
        n = int(N/2)
        log(f'S[:n]=[{S[:n]}], S[n:]=[{S[n:]}]')
        if S[:n] == S[n:]:
            result = 'Yes'
        else:
            result = 'No'

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['6', 'abcabc']
        lines_export = ['Yes']
    if pattern == 2:
        lines_input = ['1', 'abcadc']
        lines_export = ['No']
    if pattern == 3:
        lines_input = ['1', 'z']
        lines_export = ['No']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

one = S[:N//2]
two = S[N//2:]

if one == two:
    print('Yes')
else:
    print('No')

Solution (Python):


import sys
input=sys.stdin.readline

def main():
    N=int(input())
    S=input().strip("\n")
    if N%2==1:
        print("No")
    elif S[:(N//2)]==S[(N//2):]:
        print("Yes")
    else:
        print("No")
    
    
    
if __name__=="__main__":
    main()

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline


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

    if N % 2 == 1:
        ans = "No"
    else:
        if S[:N // 2] == S[N // 2:]:
            ans = "Yes"
        else:
            ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

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

if '__main__' == __name__:
    resolve()

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

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

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

if not ( 1 <= N <= 100 ): sys.exit()
if not S.islower(): sys.exit()
if not ( len(S) == N ): sys.exit()
if N % 2 == 1: print('No'); sys.exit()
print('Yes') if ( S[:N//2] + S[:N//2] == S ) else print('No')

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

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

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

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

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

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

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

if(s[:harf] == s[harf:]):
    print("Yes")
else:
    print("No")

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

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

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

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

s_h = s[:int((len(s)/2))]

s_h_2 = s[int((len(s)/2)):]


if s_h == s_h_2:
  print("Yes")
else:
  print("No")

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

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()
ans = 0

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

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

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

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

Solution (Python):
def main():
    N = int(input())
    S = str(input())
    if N % 2 == 1:
        print('No')
    elif N == 2:
        if S[0] == S[1]:
            print('Yes')
        else:
            print('No')
    else:
        n = (N // 2) - 1
        na = n + 1
        if S[0:n] == S[na:-1]:
            print('Yes')
        else:
            print('No')
main()

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

Solution (Python):
n=int(input())
s=input()
print('YNeos'[(n%2!=0 or s[0:n//2]!=s[n//2:n])::2])

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

l_a = []
l_b = []

if n%2 == 0:
  for i in range(n//2):
    l_a.append(s[i])
  for i in range(n//2, n):
    l_b.append(s[i])
  if l_a == l_b:
    print('Yes')
  else:
    print('No')
else:
  print('No')

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
INF = float("inf")

def main():
    N = int(input())
    S = input().decode().rstrip()

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

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

middle = len(S) // 2

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

ans = 'No'

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

print(ans)

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

if n % 2 != 0 :
    print("No")
else :
    t = ""
    for i in range(n//2):
        t += s[i]
    if s != t+t :
        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):
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

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


if __name__ == '__main__':
    main()

Solution (Python):
input()
s = input(); l = len(s)
if l % 2:
    print('No')
else:
    print('Yes' if (s[:(l//2)] == s[l//2:]) else  'No')

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

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

Solution (Python):
N=int(input())
S=list(input())
a1=[i for i in range(0,(N//2))]
a2=[i for i in range((N//2),N)]
a3=[S[i] for i in a1]
a4=[S[i] for i in a2]
print('Yes' if a3==a4 else 'No')

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

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

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

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

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

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
def gcd(*numbers): reduce(math.gcd, numbers)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0

N = i()
S = s()
if N % 2 != 0:
    print("No")
else:
    a = N // 2
    if S[:a] == S[a:N]:
        print("Yes")
    else:
        print("No")

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

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

else:
    print("No")

Solution (Python):
import sys




def main():
    N = int(input())
    S = input()
    if N %2 ==1:
        print("No")
        exit()
    else:
        half = int(N/2)
        if S[0:half] *2== S:
            print("Yes")
        else:
            print("No")


if __name__ == "__main__":
    main()

Solution (Python):
lst = [input() for i in range(2)]

n = int(lst[0])
s = lst[1]
t = ''

for i in range(n//2):
    t += s[i]

if n % 2 == 1:
    print('No')
elif t + t == s:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

n = int(input())
s = input()[:-1]

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

Solution (Python):

n=int(input())
s=input()
print('YNeos'[n%2>0 or s[:n//2]!=s[-(n//2):]::2])

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

Solution (Python):
import sys

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

compare_check = 0
if (len(s) <= 1) or ((len(s)%2) == 1) :
  print("No")
  sys.exit()
else:
  for i in range(len(s)//2):
    if (s[i] == s[i+len(s)//2]):
      compare_check += 1

if ((len(s)//2) == compare_check) :
  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):
if(int(input()) %2 == 1):
  print("No")
  exit()
t = input()
if(t[:len(t)//2] == t[len(t)//2:]):
  print("Yes")
else:
  print("No")

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

tmp1 = S[:int(N / 2)]
tmp2 = S[int(N / 2):]

if tmp1 == tmp2:
    print("Yes")
else:
    print("No")

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

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

if T1 == T2:
  print("Yes")
else:
  print("No")

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())
    S = readline().strip()
    if N % 2 == 0 and S == S[: N // 2] * 2:
        print('Yes')
    else:
        print('No')

    return


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S = input()
tmp1 = int(N / 2)
tmp2 = S[0:tmp1]
tmp3 = S[tmp1:]
flag = False

if tmp2 == tmp3:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
n=int(input())
s=list(map(str,input()))
if n%2==0:
    num=int(n/2)
    Sx=s[0:num]
    Sy=s[num:n]
    if Sx==Sy:
      print("Yes")
    else:
      print("No")
else:
  print("No")

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

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

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

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