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



Sample input:
6
abcabc


Sample output:
Yes

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if N%2!=0:
  print("No")
else:
  if S[:N//2]*2 == S:print("Ok")
  else : print("No")

Submission status: Wrong Answer

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

if (N % 2 == 0):
  print("True")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#a,b,c = map(int,input().split())
a = int(input())
b = input()
c = b[:a//2]
d = b[a//2:a]
print("No" if c == d else "Yes")

Submission status: Wrong Answer

Solution code:
n = int(input())
a = input()
if n%2==1:
  print("No")
elif str(a[:int(n/2)+1])==str(a[int(n/2)+1:]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
b=int(input())
a=input()
c=[]
for i in range(b):
    c.append(a[i])
#a = list(map(int,input().split()))
#b = list(map(int,input().split()))
d = b/2-1
e = b/2
if b==1:
    print("No")
elif c[:3]==c[3:]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
 
if n % 2 == 1:
	print('NO')
	exit()
    
c = n//2
    
if s[1:c] == s[c + 1:n]:
	print('YES')
else:
	print('NO')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

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


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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 問題：https://atcoder.jp/contests/abc145/tasks/abc145_b

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

res = True
len_t = n//2
for i in range(len_t):
    if s[i] != s[len_t+i]:
        res = False
        break

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

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
if n==0 or n==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==b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())
s = input()

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

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

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

Submission status: Wrong Answer

Solution code:

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

print (N)

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

Submission status: Wrong Answer

Solution code:
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')
else:
  print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
import numpy as np
n = int(input())
s = input()
h = int(n/2)
s=list(s)
f = 0
for i in range(h):
    if s[i] != s[h+i]: f = 1
if f == 0:
    print("Yes")
else: print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
if n>1:
    s=input()
    a=s[0:n//2]
    b=s[n//2:]
    c=0
    for i in range(n//2):
        if a[i]==b[i]:
            c=c+1
        else:
            pass
    if c==n//2:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
if n>1:
  a=s[0:int(n/2)]
  b=s[int(n/2):]
  c=0
  for i in range(int(len(s)/2)):
    if a[i]==b[i]:
      c=c+1
    else:
        pass
  if c==int(n/2):
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s = str(input())
n = len(s)
if n % 2 == 1:
    print("No")
    exit()
if s[:n // 2 + 1] == s[n // 2 + 1:]:
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
s = str(input())
n = len(s)
for i in range(n):
    for j in range(i):
            if s[j:i+1] in s[i+1:n]:
                print("Yes")
                exit()
print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
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')
  else:
    print('Yes')
    
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if len(s)%2 == 1:
    print('No')
else:
    m = len(s)
    s1, s2 = s[:m], s[m:]
    if s1 == s2:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
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")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

Solution code:
import sys

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

Submission status: Wrong Answer

Solution code:
a=int(input())
b=str(input())
if a==len(b):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if n % 2 != 0:
  print('No')
else:
  if s[:n-1] == s[n:]:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
s = input()
if N%2 ==1:
  print('No')
  sys.exit()
if s[:N//2] == s[N//2+1:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
s = input()
if N%2 ==1:
  print('No')
  sys.exit()
if s[:N//2] == s[N//2+1:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
s = input()
if N%2 != 1:
  print('No')
  sys.exit()
if s[:N//2] == s[N//2+1:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
t=input()
s=raw_input()
if t%2!=0:
  print "No"
else:
  if s[0:t/2]==s[t/2+1:t-1]:
    print "No"
  else:
    print "Yes"

Submission status: Wrong Answer

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

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

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

t = ''

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

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

Submission status: Wrong Answer

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

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

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

t = ''

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

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

Submission status: Wrong Answer

Solution code:
lst = [input() for i in range(0, 2)]

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

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

t = ''

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

if t + t == s:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

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

t = ''

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

if t + t == s:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
t = input()
if(len(t) %2 == 1):
  print("No")
  exit()
if(t[:len(t)//2] == t[len(t)//2:]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
count = 0
for i in range(2,len(s)+1):
  x = s[:i]
  if s.count(x) >= 2:
    count += 1
if count >= 2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
t = input()
if n % 2 != 0:
  print('No')
else:
  print('Yes' if t[:n//2] + t[n//2:] == t else 'No')

Submission status: Wrong Answer

Solution code:
n = int(input())
t = input()
if n % 2 != 0:
  print('No')
else:
  print('Yes' if t[:n//2] + t[n//2:] else 'No')

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
if N%2==0 and all(a==b for a,b in zip(S,S[N:])):
       print("Yes")
else:
       print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
if N%2==0 and all(a==b for a,v in zip(S,S[N:])):
       print("Yes")
else:
       print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
if all(a==b for a,v in zip(S,S[N:])):
       print("Yes")
else:
       print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=list(dict.fromkeys(list(input())))
print('Yes' if len(S)==N/2 else 'No')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
if S[:3] == S[3:]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

flag=True

if N%2 != 0:
    flag=False
else:
    for i in range(N//2-1):
        if(S[i]!=S[N//2+i]):
            flag=False
            break

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n % 2 != 0:
  print("No")
else:
  T = s[0:n//2+1]
  if T + T == s:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n % 2 != 0:
  print("Yes")
else:
  T = s[0:n//2+1]
  if T + T == s:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
l=[]
for i in s:
  l.append(i)

org_l=[]
count=0
for i in l:
  org_l.append(i)
  count+=1
  if count==n//2:
    break

new_l=[]
for i in l[n//2:]:
  new_l.append(i)

if org_l == new_l:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    S = input()
    if N == 1:
        print("No")
        exit(0)
    half = int(N / 2)
    for i in range(half):
        if S[i] != S[half + i]:
            print("No")
            exit(0)

    print("Yes")


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
n=int(input())
a=input()
if n%2==0 and a[:n//2]==a[n//2:]:
    print("Yes")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(s[:int(n/2)])
print(s[int(n/2):])


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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input().split()
X = S[:N//2+1]
if N%2 == 0 and X+X == S:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
listed_s = list(s)
if n % 2 == 0:
    if "".join(listed_s[0: (n // 2 - 1)]) == "".join(listed_s[(n // 2): n - 1]):
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Wrong Answer

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

mid = int(n/2)


if n == 1:
    print("No")
elif s[:mid] == s[:mid]:
    print('Yes')
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = raw_input()
print 'Yes' if len(s) % 2 == 0 and s[:len(s)/2] == s[len(s)/2:] else 'No'

Submission status: Wrong Answer

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

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

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

print('Yes')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=str(input())
r=s[:n//2]
t=s[n//2:]
print(r)
print(t)
if(r==t):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=str(input())
r=s[:3]
t=s[3:]
if(r==t):
  print("Yes")
  
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
if N%2==0 and all(s==v for s,v in zip(S,reversed(S))):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
if all(s==v for s,v in zip(S,reversed(S))):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


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

elif S[:N//2] == S[N//2:]:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
args=input()
print('Yes')

Submission status: Wrong Answer

Solution code:
a=input()
print('Yes')

Submission status: Wrong Answer

Solution code:
print('Yes')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3

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

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
    if i == k:
        y += 1
    else:
        n += 1
if y >= int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2), N):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i, k in zip(T, S):
    if i == k:
        y += 1
    else:
        n += 1
if y == int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2)):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i in range(int(N / 2), N):
    for k in range(int(N / 2)):
        if T[k] == S[i]:
            y += 1
        else:
            n += 1
if N % 2 != 0:
    print('No')
elif y >= int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2)):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i in range(int(N / 2), N):
    for k in range(int(N / 2)):
        if T[k] == S[i]:
            y += 1
        else:
            n += 1
if N % 2 != 0:
    print('No')
elif y == int(N / 2):
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2)):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i in range(int(N / 2), N):
    for k in range(int(N / 2)):
        if T[k] == S[i]:
            y += 1
        else:
            n += 1
if y == int(N / 2):
    print('Yes') 
elif N % 2 != 0:
    print('No')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
T = list()
for i in range(int(N / 2)):
    t = S[i]
    T.append(t)
y = 0
n = 0
for i in range(int(N / 2), N):
    for k in range(int(N / 2)):
        if T[k] == S[i]:
            y += 1
        else:
            n += 1
if y == 4:
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# input
N = int(input())
S = input()

# check
if N < 2 or N % 2 != 0:
    print("No")

if N == 2:
    right = S[0]
    left = S[1]
else:
    c = N // 2
    right = S[0:c]
    left = S[c:]

if right == left:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# input 
N = int(input())
S = input()

# check
if N < 2 or N % 2 != 0:
    print("No")

if N == 2:
    right = S[0]
    left = S[1]
else:
    c = N // 2
    right = S[0:c - 1]
    left = S[c:]

if right == left:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = input()
y = input()
n = int(x[0])
mid = int(n/2)
k1 = mid
answer = 0
s1 = []
s2 = []

if int(x) > 1:
  for i in range(k1):
    s1.append(y[i])
    s2.append(y[i+mid])
  if s1 == s2:
    print("Yes")
  else:
    print("No")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

s_len = len(s)
half_s_len = len(s) // 2

if s_len % 2 == 1:
  print('No')
  
if s[0:half_s_len-1] == s[half_s_len:-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
def main():
    _len = int(input())
    _str = input()

    if _len > 0 or _len < 100 or _len % 2 : 
        print("No")
        return

    print(_len/2)
    a, b = _str[:_len/2], _str[_len/2:]

    print("Yes" if a == b else "No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())
s = input()

i = int(r/2)
before = s[i:]
after = s[:i]

if before == after:
	print('Yes')
else:
  	print('no')

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
cnt = 0
if n % 2 == 0:
    for i in range(n//2):
        if s[i] == s[i + n // 2]:
            cnt += 1
else:
        for i in range(n//2):
            if s[i] == s[i + n // 2 + 1]:
                cnt += 1

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
cnt = 0
if n % 2 == 0:
    for i in range(n//2):
        if s[i] == s[i + n // 2]:
            cnt += 1
else:
    for i in range(n//2):
        if s[i] == s[i + n // 2 + 1]:
            cnt += 1


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

Submission status: Wrong Answer

Solution code:
def main():
    N = int(input())
    S = input()
    if (N % 2 == 1):
        print('No')
    else:
        mid = N // 2
        print('Yes' if (S[:mid-1] == S[mid:]) else 'No')
    return 0
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
length = int(input())
s = input()

if s[:length // 2] == s[length // 2:]:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

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

if(n % 2 == 1):
  print('No')
else:
  for i in range(n//2 - 1):
    if(s[i] != s[n//2 + i]):
      print('No')
      sys.exit()

  print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
input_str = str(input())
str_len = len(input_str)
half = int(str_len/2)
if(str_len % 2 == 0 and input_str[0:half] == input_str[half:str_len]):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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