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 len(S)%2==1:
    print('No')
else:
    for i in range(len(S)//2):
        if S[i]!=S[i+(len(S)//2)]:
            print('No')
            break
        else:
            continue
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if N%2==1:
    print("No")
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 == 1:
    print("No")
    exit()
if n != 1:
    a = 0
for i in range(n//2):
    #print(s[i], s[(n//2)+i])
    if s[i] == s[(n//2)+i]:
        a += 1

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

Submission status: Wrong Answer

Solution code:
S = input()
if len(S)%2 == 1:
    print('No')
    exit()

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

Submission status: Wrong Answer

Solution code:
S = input()
if len(S)%2 == 1:
    print('No')
    exit()

if S[0:int(len(S)/2)] == S[int(len(S)/2):len(S)]:
    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()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
if n %2 !=0:
            print('No')
elif n//2==len(set(s)):
            print('Yes')
else:
            print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = list(input())
h = (N / 2) - 1
if len(S) % 2 != 0:
    print('No')
else:
    if S[:int(h)] == S[int(h+1):-1]:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if n%2==0:
    c=n//2
    if(s[c:] == s[:c]):
        print('yes')
    else:
        print('no')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
#145 b
n=int(input())
s=input()
ans="No"
if n%2==1:
    print(ans)
else:
    x=int(n/2)
    if s[0:x]==s[x:]:
        ans="Yes"
        print(ans)

Submission status: Wrong Answer

Solution code:
#145 b
n=int(input())
s=input()
ans="No"
if n%2==1:
    print(ans)
else:
    x=int(n/2)
    if s[0:x]==s[x:]:
        ans="Yes"
print(ans)

Submission status: Wrong Answer

Solution code:

n = int(input())
s = list(input())
a = int(n/2)
b = 0
la =[]
lb =[]
for i in range(int(len(s)/2)):
    la.append(s[i])
    lb.append(s[i+a])

if str(la) == str(lb) and n != 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:

n = int(input())
s = list(input())
a = int(n/2)
b = 0
la =[]
lb =[]
for i in range(int(len(s)/2)):
    la.append(s[i])
    lb.append(s[i+a])

if str(la) == str(lb) and n > 1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

Solution code:
# -*- coding utf-8 -*-

MOD = 10 ** 9 + 7

n = int(input())
s = input()
print(s[:n//2], s[n//2:])

if n % 2 ==0:
    ans = 'Yes' if s[:n//2] == s[n//2:] else 'No'
else:
    ans = 'No'

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
a=int(input())
b=list(input())

if a%2==1:
  print('No')
  sys.exit()
c=''
d=''

for i in range(a//2-1):
  c=b[i]
  d=b[i+a//2]
if c==d:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a=int(input())
b=list(input())
c=''
d=''

for i in range(a//2-1):
  c=b[i]
  d=b[i+a//2]
if c==d:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
a=int(input())
b=list(input())
c=0
if a==1:
  print('No')
  sys.exit()
for i in range(a//2):
  if  b[i]==b[i+(a//2)]:
    c+=1
  else:
    pass
  if c>=a//2:
    break
  
if c==a//2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import sys
a=int(input())
b=list(input())
c=0
if a==1:
  print('No')
  sys.exit()
for i in range(a//2):
  if  b[i]==b[i+(a//2)]:
    c+=1
  else:
    pass
if c==a//2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
r = int(input())
print(r**2)

Submission status: Wrong Answer

Solution code:
i=input()
S=input()
if S[:len(S)//2] != S[len(S)//2] or len(S)%2 !=0:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
i=input()
print(int(i)**2)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if s[:n-1] == s[n-1:]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

    if len(S) % 2 == 1:
        print('No')
    l = len(S) // 2
    if S[:l] == S[(-1 * l):]:
        print('Yes')
    else:
        print('No')

ABC145B()

Submission status: Wrong Answer

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

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

ABC145B()

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
 
print('yes' if s[:n//2] == s[n//2:] else 'no')

Submission status: Wrong Answer

Solution code:
N=int(input())
S=str(input())
if S[0:int(N/2)]==S[int(N/2):N]:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
S = input()
index = len(S) // 2

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

Submission status: Wrong Answer

Solution code:
S = input()

if len(S) % 2 != 0:
  matched = False
else:
  matched = True
  index = len(S)//2
  for i in range(index):
    if S[i] != S[index+i]:
      matched = False
      break

if matched:
  print('Yes')
else:
  print('False')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
len_S = len(S)
count = 0

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

else:
    for i in range(len_S//2):
        if S[i] == S[i+(len_S//2)]:
            count += 1
        else:
            print('No')
            break

if count == len_S//2:
    print('Yes')

Submission status: Wrong Answer

Solution code:
"""
author : halo2halo
date : 9, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

N = int(readline())
S = readline().decode('utf8').rsplit()

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

Submission status: Wrong Answer

Solution code:
input = [input() for i in range(2)]
n = int(input[0])
s = input[1]

if(n % 2 != 0):
  print('NO')
elif(n != len(list(s))):  
  print('NO')
else:  
  s_list = list(s)
  num = n/2
  s1 = s_list[:int(num)]
  s2 = s_list[int(num):]

  if(len(s1) != len(s2)):
    print('NO')    
  else:  
    flag = True  
    for index in range(len(s1)):
      if(s1[index] != s2[index]):
        flag = False

    if(flag):
      print('YES')
    else:
      print('NO')

Submission status: Wrong Answer

Solution code:
yes = "Yes"
no  = "No"

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

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

    mid = N // 2
    left = S[:mid]
    right = S[:mid]
    if left == right:
        print(yes)
    else:
        print(no)

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
if S[:N//2] == S[N//2:]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if N % 2 != 0:
    print('NO')
else:
    num =int( N / 2)
    f = S[0:num]
    if S == f+f:
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = str(input())
num =int( N / 2)

f = S[0:num]

if S == f+f:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('YES')  
    else: 
        print('NO')
        
else:
    print('NO')

Submission status: Wrong Answer

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

if (N % 2 == 0):
    c = int(N / 2)

    n = 0
    for x in range(c):
        if S[x] == S[x + c]:
            n += 1 

    if n == c:
        print('YES')  
    else: 
        print('NO')
        
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
is_duplicate = True
if N == 1:
    print('No')
else:
    for i in range(int(N/2)):
        if S[i] != S[i + int(N/2)]:
            is_duplicate = False

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

Submission status: Wrong Answer

Solution code:
N=int(input())
S=list(input())
d=1
for i in range(N//2):
  if S[i]!=S[i+N//2]:
    d=0
print('Yes' if d==1 and N!=1 else 'No')

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

Solution code:
n = int(input())//2
s = input()
print('yes' if s[:n] == s[n:] else 'no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=  input()
s= input()
if n+n==s:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input());
s = str(input());
#s = [str(i) for i in input().split()];
#print(n);
#print(s);

judge = 'No';
for i in range(n) :
    for j in range(i+2,n) :
        #print(j);
        tmp = s[i:j];
        #print(tmp);
        #print(s.count(tmp));
        if s.count(tmp) > 1:
            if tmp+tmp == s :
                judge = 'Yes';
                break;
print(judge);

Submission status: Wrong Answer

Solution code:
n = int(input());
s = str(input());
#s = [str(i) for i in input().split()];
#print(n);
#print(s);

judge = 'No';
for i in range(n) :
    for j in range(i+2,n) :
        #print(j);
        tmp = s[i:j];
        #print(tmp);
        #print(s.count(tmp));
        if s.count(tmp) > 1:
            judge = 'Yes';
            break;
print(judge);

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
s1 = list()
s2 = list()
if N % 2 == 1:
    print("No")
else:
    for i in range(N//2):
        s1.append(S[i])
    for i in range(N//2+1,N):
        s2.append(S[i])
    if s1 == s2:
        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 = str(input());
#s = [str(i) for i in input().split()];
#print(n);
#print(s);

judge = 'No';
for i in range(n-int(n/2), 1,-1) :
    #print(i);
    tmp = s[0:i];
    #print(tmp);
    #print(s.count(tmp));
    if s.count(tmp) > 1:
        judge = 'Yes';
        break;
print(judge);

Submission status: Wrong Answer

Solution code:
n = int(input());
s = str(input());
#s = [str(i) for i in input().split()];
#print(n);
#print(s);

judge = 'NO';
for i in range(n-int(n/2), 1,-1) :
    #print(i);
    tmp = s[0:i];
    #print(tmp);
    #print(s.count(tmp));
    if s.count(tmp) > 1:
        judge = 'YES';
        break;
print(judge);

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
c=0
for i in range(N):
  if i<=N/2-1 and S[i]==S[N-1-i]:
    c+=1
if c==N/2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
c=0
for i in range(int(N/2)):
  if S[i]==S[N-1-i]:
    c+=1
if c==N/2:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n == 1 or n % 2 == 1:
  print("no")
  exit()
if s[0:n//2] == s[n//2:n]:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if s[0:n//2] == s[n//2:n]:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n == 1 or n % 2 == 1:
  print("no")
if s[0:n//2] == s[n//2:n]:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
if n == 1:
  print("no")
if s[0:n//2] == s[n//2:n]:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

if length==1:
    print("No")
else:
    a=''
    b=''

    for i in range(length//2):
        a+=c[i]
        b+=c[length//2 + i]
   
    if a==b:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

if length==1:
    print("no")
else:
    a=''
    b=''

    for i in range(length//2):
        a+=c[i]
        b+=c[length//2 + i]
   
    if a==b:
        print("yes")
    else:
        print("no")

Submission status: Wrong Answer

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

if length%2!=0:
    print("no")

 
a=''
b=''

for i in range(length//2):
    a+=c[i]
    b+=c[length//2 + i]

if a==b:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

Solution code:
n = input()
s = list(input())
if n ==1:
    print("No")
else:
    n2 = int(int(n)/2)


    if n2 ==1:
        print('No')

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

Submission status: Wrong Answer

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


if n2 ==1:
    print('No')

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = input()
LENS = int((len(S))/2)
mae = S[0:LENS]
usiro = S[LENS:len(S)]

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

Submission status: Wrong Answer

Solution code:
a = input()
if len(a) % 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')

Submission status: Wrong Answer

Solution code:
n = int(input()) # length of string
str = input()
mid = n // 2 # the first char in later str
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")

Submission status: Wrong Answer

Solution code:
n = int(input()) # length of string
str = input()
mid = n // 2 # the first char in later str
counter = 0
for i in range(mid):
  if n % 2 != 0:
    print("No")
    break
  elif str[i] == str[mid + i]:
    counter += 1
    
if counter == mid :
  print("Yes")

Submission status: Wrong Answer

Solution code:
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])
print(a,b)
if a==b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if s[:n]==s[n:]:
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=input()
s=input()
if s==n+n:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

s_length = len(s)

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
n2 = int(N/2)

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

Submission status: Wrong Answer

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

if len(s)%2==1 :
    print("No")
elif 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()

if len(s)==1 :
    print("No")
if s[0:N//2-1]== s[N//2:N-1]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

half_index = n // 2
right_index = n - half_index

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
n=int(input())
hn=n//2
tx=input()
tx1=tx[:hn]
tx2=tx[hn:]
print(tx1,tx2)
if tx1==tx2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

ABC145B_Echo()

Submission status: Wrong Answer

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

half = int(N / 2)

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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


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

print("Yes")

Submission status: Wrong Answer

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

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

print("Yes")

Submission status: Wrong Answer

Solution code:
import sys

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

if(N%2==1 or N==0):
    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")

Submission status: Wrong Answer

Solution code:
import sys

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

if(N%2==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")

Submission status: Wrong Answer

Solution code:
import sys

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

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

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

print("Yes")

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:
import sys
#input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(input())
S = input()

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
t=int(N/2)
s1=S[:t]
s2=S[t:]
if s1==s2:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
t=int(N/2)
letter1=S[:t]
letter2=S[t:]
if N%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

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

t=int(int(N)/2)
letter1=S[:t]
letter2=S[t:]
if int(N)%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

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

t=int(int(N)/2)
letter1=S[0:t]
letter2=S[t:]
if int(N)%2==1:
  print('NO')
else:
  if letter1==letter2:
    print('YES')
  else:
    print('NO')

Submission status: Wrong Answer

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

t=int(int(N)/2)
letter1=S[0:t]
letter2=S[t:]
if letter1==letter2:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
a = []
b = []
count = 1
for i in s:
  if count > (n/2):
    a.append(i)
  else:
    b.append(i)
  count += 1
print(a)
if a == b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
  if count > (n//2) + 1:
    a.append(i)
  else:
    b.append(i)
  count += 1
if a == b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n = int(input())
s = input()
a = []
b = []
count = 0
for i in s:
  if count > (n//2):
    a.append(i)
  else:
    b.append(i)
  count += 1
if a == b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
k=set(s)
a=[]
for i in k:
  a.append(s.count(i))
  if len(set(a))!=1:
    print("No")
    break
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
Flag = True
if N % 2 == 1:
  Flag = False
else:
  for i in range(0,int(N/2)-1):
    a = S[i]
    b = S[int(i+(N/2))]
    if a != b :
      Flag = False
if Flag == True:
  print('Yes')
elif Flag == False:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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