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 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:
n = int(input())
s = list(input())
t1 = s[:n//2]
t2 = s[n//2:]

count = 0
for  i in range(n//2):
    if t1[i] == t2[i]:
        count += 1
if count == n//2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(2,Num):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c = c + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
 
#input
N = int(input())
S = str(input())
 
#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    M = N//2
    T = S[:M]
    U = S[M:]
    if T == U:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
 
#input
N = int(input())
S = str(input())
 
#output
if N % 2 == 1:
    print("No")
elif N % 2 == 0:
    M = int(N/2)
    T = S[:M]
    U = S[M:]
    if T == U:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(2,Num+1):
        if Num%l == 0 and l != Num:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c = c + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
S = input().split()
 
if N%2==0:
  s1 = S[:(N//2)]
  if S == s1 + s1:
    print('Yes')
  else:
    print('No')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(2,Num+1):
        if Num%l == 0 & l != Num:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c = c + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s = input()
s = input()
if (s[:len(s)//2] ==s[len(s)//2:]):
	print("YES")
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
import sys
N = int(input()) #yesの場合は偶数
n = int(N/2)
S = list(input())
T = [0]*n
if N%2 == 0:
    for i in range(n):
        T[i] = S[i]
        if S[i] in T[i]:
            print("Yes")
            sys.exit()
        else:
            print("No")
            sys.exit()
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(2,Num+1):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c = c + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
N = int(input()) #yesの場合は偶数
n = int(N/2)
S = list(input())
T = [0]*n
for i in range(n):
    T[i] = S[i]
    if S[i] == T[i]*2:
        print("Yes")
        sys.exit()
    else:
        print("No")
        sys.exit()

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(2,Num):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c = c + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes",a)
else:
    print("No")

Submission status: Wrong Answer

Solution code:
N , S = [input() for i in range(2)]
N = int(N)

N += 1

for i in range(N):
    for b in range(N):
        T = S[b:i]
        T = T + T

        if i > 1 and T in S:
            print('Yes')
            break
    else:
        continue
    break
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np

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

if n == 1:
    print("No")
    quit()

for i in range(int(n / 2)):
    if not s[i] == s[i + int(n / 2)]:
        print("No")
        quit()

print("Yes")

Submission status: Wrong Answer

Solution code:
import sys
N = int(input())
S = list(map(str,input().split()))
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	for i in range(len(T_1)):
		if T_1[i] != T_2[i]:
			print("No")
			sys.exit()	
	print("Yes")
	sys.exit()
else:
	print("No")

Submission status: Wrong Answer

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

if (N % 2) == 1:
    ans = "no"
else:
    n = int(N/2)
    s1 = S[0:n]
    s2 = S[-n:]
    if s1 == s2:
        ans="Yes"
    else:
        ans ="No"
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()
S_moto = str(S_moto)

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

S_1 = S_moto[0:N//2]
S_2 = S_1+S_1
S_2=str(S_2)
print(S_2)
if S_moto == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(1,Num):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c += b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(N,S)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(1,Num):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            c = []
            for i in range(j+1):
                b.append(alpha[i])
            for k in range(l):
                c += b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(9,"abcabcabc")
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()

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

S_1 = S_moto[0:N//2]
S_2 = S_1+S_1
S_2=str(S_2)
if S_moto == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def moji_hanbetsu(S,N):
    if (N % 2) == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="Yes"
        else:
            ans ="No"
    return ans
 
N = int(input())
S = input()


print(moji_hanbetsu(S,N))

Submission status: Wrong Answer

Solution code:
N = int(input())
if N>=1:
    S = str(input())
    S = S.replace('abc', 'T')
    if len(S) == N:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=input()
sub=s[0:(n//2)]
if n==1:
    print("No")
elif s.count(sub)==2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()

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

S_1 = S_moto[0:N//2]
S_2 = S_1+S_1
#S_2 = ''.join(S_2)
#print(S_2)
if S_moto == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()

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

S_1 = S_moto[0:N//2]
S_2 = S_1+S_1
#S_2 = ''.join(S_2)
print(S_2)
if S_moto == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

S = str(input())

char_list = list(S)

a = str(char_list[0])
n = int(N / 2)
b = str(char_list[n])

for i in range(1,n):
    a = str(a + char_list[i])
    b = str(b + char_list[i + n])

if(a == b):
    print("Yes")
elif(a != b):
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N=int(input())
S=input()
x=bool
y=bool
if len(S)==N and len(S)%2==0:
    for i in S:
        if S[0:int(len(S)/2)-1]==S[int(len(S)/2):len(S)-1]:
            x=True
        else:
            x=False
    if x==True:
        print('YES')
    else:
        print('NO')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(1,Num,1):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            for i in range(j+1):
                b.append(alpha[i])
            c = b + b
            if alpha == c:
                s.append(1)
            else:
                s.append(0)
        else:
            s.append(0)
    return s

N = int(input())
S = input()
a = judge1(6,"abcabc")
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S_moto = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S_moto)
S_1 = S[0:N//2]
S_2 = S_1+S_1
S_2 = ''.join(S_2)
print(S_2)
if S_moto == S_2:
    print("Yes")
    sys.exit
else:
    print("No")
    sys.exit

Submission status: Wrong Answer

Solution code:
len = int(input())
str = input()
flag = True

if len % 2 == 1:
  flag = False
else:
  for i in range(int(len/2)):
    print(str[i])
    print(str[i + int(len / 2)])
    if str[i] != str[i + int(len / 2)]:
      flag = False

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

Submission status: Wrong Answer

Solution code:
len = int(input())
str = input()
flag = True

if len % 2 == 1:
  flag = False
else:
  for i in range(int(len/2)):
    if str[i] != str[i + int(len / 2)]:
      flag = False

if flag:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
def moji_hanbetsu(S,N):
    if (N % 2) == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="Yes"
        else:
            ans ="No"
    return ans
 
N = int(input())
S = input()

print(moji_hanbetsu(S,N))

Submission status: Wrong Answer

Solution code:
def moji_hanbetsu(S,N):
    if (N % 2) == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="yes"
        else:
            ans ="no"
    return ans
 
N = int(input())
S = input()

print(moji_hanbetsu(S,N))

Submission status: Wrong Answer

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

if n%2==0:
  
  for i in range(int(n/2)):   
    if s[i]==s[i+int(n/2)]:
      total+=1
  
  if total==int(n/2):
    print('Yes')
  else:
    print('N0')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    s = []
    for l in range(1,Num,1):
        if Num%l == 0:
            alpha = list(a)
            j = int(Num/l - 1)
            b = []
            for i in range(j+1):
                b.append(alpha[i])
            c = b + b
            if alpha == c:
                s.append("yes")
            else:
                s.append("No")
        else:
            s.append("No")
        return s

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

if judge1(6,"abcabc") in ["yes"]:
    print("yes")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S)
S_1 = S[0:N]
S_2 = S_1+S_1
S = str(S)
S_2 = str(S)
if S == S_2:
    print("Yes")
    sys.exit
else:
    print("No")
    sys.exit

Submission status: Wrong Answer

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

if len % 2 == 1:
  print("no")

flag = True
for i in range(int(len/2)):
  if str[i] != str[i + int(len / 2)]:
    flag = False

if flag:
  print("yes")
else:
  print("no")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(str(input().split()))
if n%2==1:
  print("No")
else:
  for i in range(int(n/2)):
    if s[2+i]!=s[2+int(n/2)+i]:
      break
  if i==n/2-1:
    if s[2+i]==s[2+int(n/2)+i]:
      print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input())
S = list(map(str,input().split()))
if N % 2 == 0:
	T_1 = S[:int(len(S)/2)]
	T_2 = S[int(len(S)/2):]
	for i in range(len(T_1)):
	 if T_1[i] == T_2[i]:
	 	print("Yes")
	 else:
	 	print("No")
else:
	print("No")

Submission status: Wrong Answer

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

l = N//2
scr = 0
for i in range (l):
  if S[i] == S[l+i]:
    scr +=1
    #print("YES")
  else:
    scr -=10000
    #print("NO")
if scr >0:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
N = int(input()) 
s = input() 
b = int(N/2)

if N % 2 == 1:
  print('No')
else:
  s1 = s[0:b]
  s2 = s[b:N]
  print(s1)
  print(s2)
  if s1 == s2:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = int(input())

n = list(map(str,input()))

ans = int(0)

S = int(s/2)

for i in range(S):
  if n[i] == n[S+i]:
    ans += 1
    
if ans == S and s != 1:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
n=int(input())
s=list(str(input().split()))
if n%2==1:
  print("No")
else:
  for i in range(int(n/2)):
    if s[2+i]!=s[2+int(n/2)+i]:
      break
  if i==n/2-1:
    print("Yes")
  else:
    print("No")

Submission status: Wrong Answer

Solution code:
N = int(input()) 
s = input() 
b = int(N/2)
#print(int(b))
if N % 2 == 1:
  print('no')
else:
  s1 = s[0:b]
  s2 = s[b:N]
#  print(s1)
#  print(s2)
  if s1 == s2:
    print('yes')
  else:
    print('no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
def seigi(s):
  lens = len(s)
  if lens%2==1:
    return "No"
  lensp2 = int(lens/2)
  for si in range(lensp2):
    if s[si] != s[si + lensp2]:
      return "No"
  return "Yes"
  
s = input()
print(seigi(s))

Submission status: Wrong Answer

Solution code:
N , S = [input() for i in range(2)]
N = int(N)

if N == 1:
    o = N
else:
    o = int(N / 2)

o += 1

for i in range(o):
    T = S[0:i]
    T = T + T

    if i != 0 and T in S:
        print('Yes')
        break
else:
    print('No')

Submission status: Wrong Answer

Solution code:
s = int(input())

n = list(map(str,input()))

ans = int(0)

S = int(s/2)

for i in range(S):
  if n[i] == n[S+i]:
    ans += 1
    
if ans == S:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
N , S = [input() for i in range(2)]
N = int(N)

if N == 1:
    o = N
else:
    o = int(N / 2)

o += 1

for i in range(o):
    T = S[0:i]
    T = T + T

    if i != 0 and T in S:
        print('YES')
        break
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S)
S_1 = S[0:N]
S_2 = S_1+S_1
if S == S_2:
    print("Yes")
    sys.exit
else:
    print("No")
    sys.exit

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def seigi(s):
  lensp2 = int(len(s)/2)
  if lensp2==1:
    return "No"
  for si in range(lensp2):
    if s[si] != s[si + lensp2]:
      return "No"
  return "Yes"
  
s = input()
print(seigi(s))

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S)
S_1 = S[0:N//2]
S_2 = S_1+S_1
if S == S_2:
    print("Yes")
    sys.exit
else:
    print("No")
    sys.exit

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def judge1(Num,a):
    if Num%2 == 0:
        alpha = list(a)
        j = int(Num/2 - 1)
        b = []
        for i in range(j+1):
            b.append(alpha[i])
        c = b + b
        if alpha == c:
            print("yes")
        else:
            print("No")
    else:
        print("No")

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

judge1(N,S)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
 
if(N % 2 == 1):
    print("No")
nn = int(N / 2)
if(S[nn:] == S[:nn] and S[nn:] is S[:nn]):
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S)
S_1 = S[0:N//2]
#print(S_1)
#print(S_1)
#S_2 = S[N_h:]
S_2 = S_1+S_1
#print(S_2)
if S == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

l = N//2
scr = 0
for i in range (l):
  if S[i] == S[l+i]:
    scr +=1
    #print("YES")
  else:
    scr -=100
    #print("NO")
if scr >0 :
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
n=int(input())
s=str(input())
if n%2==1:
    print('No')
else:
    number=int(n/2)
    print(number)
    sf=[]
    sb=[]
    for i in range(0,number):
        sf.append(s[i])
    for j in range(number,n):
        sb.append(s[j])
    if sf==sb:
        print('Yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
check = False
for mojisu in range(1, N):
    for start in range(N-mojisu):
        if S[start:start+mojisu] == S[start+mojisu:start+mojisu+mojisu]:
            check = True
 
if check:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

res = False
for i in range(N-1):
	for j in range(i+2, N+1):
		t = S[i:j]
		if S.count(t) >= 2:
			res = True
			break

print('Yes' if res==True else 'No')

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
if N%2==1:
    print('No')
    sys.exit()

S = list(S)
S_1 = S[0:N//2]
print(S_1)
S_2 = S_1+S_1
print(S_2)
if S == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

l = N//2
scr = 0
for i in range (l):
  if S[i] == S[l+i]:
    scr +=1
    #print("YES")
  else:
    scr -=100
    #print("NO")
if scr >0 :
  print("Yes")
else:
  print("No")
print(l)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import re
a = [input() for i in range(2)]
length, string = int(a[0]), a[1]
pattern = string[0:int(length/2)]
cond1 = len(string) == length
cond2 = re.match(r"^[a-z]+$", string)
cond3 = len(re.findall(pattern, string)) == 2
if cond1 and cond2 and cond3:
  print("Yes")
else:
  print('No')

Submission status: Wrong Answer

Solution code:
from collections import Counter
size = int(input())
a = input()
c1 = Counter(a)
flag = False
ans = []
for i,j in c1.items():
    ans.append(j)
if len(set(ans))==1:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

nHalf = int(n / 2)

if (nHalf == 1):
	print("No")
elif (n == 0):
	print("No")
else:
    if (t[:nHalf] == t[nHalf:]):
    	print("Yes")
    else:
    	print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()
S = list(S)
S_1 = S[0:N//2]
#print(S_1)
#S_2 = S[N_h:]
S_2 = S_1+S_1
if S == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

nHalf = int(n / 2)

if (nHalf == 1):
	print("No")
else:
    if (t[:nHalf] == t[nHalf:]):
    	print("Yes")
    else:
    	print("No")

Submission status: Wrong Answer

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

l = N//2
scr = 0
for i in range (l):
  if S[i] == S[l+i]:
    scr +=1
    #print("YES")
  else:
    scr *=-1
    #print("NO")
if scr >0 :
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

S = str(input())

char_list = list(S)

a = str(char_list[0])
n = int(N / 2)
b = str(char_list[n])

for i in range(1,n):
    a = str(a + char_list[i])
    b = str(b + char_list[i + n])

if(a == b):
    print("yes")
elif(a != b):
    print("no")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    inNumber = input()
    inStr = input()

    try:
        wk_inNumber = int(inNumber)
    except Exception as e:
        print('No')
        return 0
    if wk_inNumber > 100 or wk_inNumber <= 0:
        print('No')
        return 0

    if inStr.islower() == False:
        print('No')
        return 0

    charInstr = list(inStr)

    if wk_inNumber % 2 == 1:
        print('No')
        return 0

    if wk_inNumber != len(charInstr):
       print('No')
       return 0

    i = 0
    while i < wk_inNumber / 2 :
        j = int(wk_inNumber / 2 + i)
        if charInstr[i] != charInstr[j]:
            print(i)
            print(charInstr[i])
            print('No')
            return 0
        i += 1

    print('Yes')


main()

Submission status: Wrong Answer

Solution code:
def moji_hanbetsu(S,N):
    if N % 2 == 1:
        ans = "no"
    else:
        n = int(N/2)
        s1 = S[0:n]
        s2 = S[-n:]
        if s1 == s2:
            ans="yes"
        else:
            ans ="no"
    return ans

S="abcabc"
N=6
print(moji_hanbetsu(S,N))

Submission status: Wrong Answer

Solution code:
n=int(input())
a= input()
l=[]
x=[]
y=[]
if n%2!=0:
    print('No')
else:
    for i in range(len(a)):
        l.append(a[i])
    for i in range(n//2):
        x.append(a[i])
    for j in range(n//2,n):
        y.append(a[j])
    if x==y:
        print('yes')
    else:
        print('No')

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()

S_1 = S[:N//2]
#print(S_1)
#S_2 = S[N_h:]
S_2 = S_1+S_1
if S == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
INPUT = sys.stdin.readline
#入力関数
def SORO_INT(): return int(INPUT())
def MULT_INT_LIST(): return list(map(int, INPUT().split()))
def MULT_INT_MAP(): return map(int, INPUT().split())
def SORO_STRING(): return INPUT()
def MULT_STRING(): return INPUT().split()

N = SORO_INT()
S = SORO_STRING()

if N%2==0:
    N = int(N)
else:
    print('No')
    sys.exit()
S_1 = S[:N//2]
#print(S_1)
#S_2 = S[N_h:]
S_2 = S_1+S_1
if S == S_2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import re
a = [input() for i in range(2)]
length, string = int(a[0]), a[1]
pattern = string[0:int(length/2)]
if len(string) != length: print("No")
result = re.findall(pattern, string)
if len(result) == 2:
  print("Yes")
else:
  print('No')

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def main():
    inNumber = input()
    try:
        wk_inNumber = int(inNumber)
    except Exception as e:
        print('No')
        return 0
    if wk_inNumber > 100 or wk_inNumber <= 0:
        print('No')
        return 0

    inStr = input()
    if inStr.islower() == False:
        print('No')
        return 0

    charInstr = list(inStr)

    if wk_inNumber % 2 == 1:
        print('No')
        return 0

    if wk_inNumber != len(charInstr):
       print('No')
       return 0

    i = 0
    while i < wk_inNumber / 2 :
        j = int(wk_inNumber / 2 + i)
        if charInstr[i] != charInstr[j]:
            print(i)
            print(charInstr[i])
            print('No')
            return 0
        i += 1

    print('Yes')


main()

Submission status: Wrong Answer

Solution code:
N = int(input())
S = input()
n = N//2
s = S[0:n]
sa =S[n:N]
if N==2:
  print('no')
elif not N%2==0:
  print('no')
elif s==sa:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
import sys
n=int(input())
s=str(input())

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

Submission status: Wrong Answer

Solution code:
length = int(input())
str_ls = list(map(str, input().split()))
num = length // 2
ls_1 = str_ls[:num]
ls_2 = str_ls[num:]
if length == 1:
    print('No')
elif ls_1 == ls_2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(int(1e6))

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

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

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