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: Runtime Error

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

flag=0

if N%2==0:
    for i in range(int(N/2)):
        if S[i]!=S[i+3]:
            flag+=1

    if flag==0:
        print('Yes')
    else:
        print('No')
else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n = INT()
s = input()

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

Submission status: Runtime Error

Solution code:
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n = INT()
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
ln=input()
s=input()
if len(s)%2:
	print("No")
elif s[:((len(s)/2)]==s[(len(s)/2):]:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int()input()
S=input()
bit=0
for i in range(0,N):
  Check=S[0:i]
  Ans=S[i:N]
  if Check==Ans:
    bit+=1
print("Yes" if bit>=1 else "No")

Submission status: Runtime Error

Solution code:
s = input()
t = len(s)
if s[:t//2]==s[s//2]:
  print('Yes')
else: print('No')

Submission status: Runtime Error

Solution code:
s = input()
t = len(s)
if s[:t//2]=s[s//2]:
  print('Yes')
else: print('No')

Submission status: Runtime Error

Solution code:
number = input(N)
word = list(input((S))
judge = 'Yes'
            
if N%2 == 1:
    print('No')
elif for i in range(N/2 - 1):
    if word[i] != word[N/2+i]:
        judge = 'No'

print(judge)

Submission status: Runtime Error

Solution code:
number = input(N)
word = list(input((S))
judge = 'Yes'
            
if N%2 == 1:
    print('No')
elif for i in range(N/2):
    if word[i] != word[2i]:
        judge = 'No'

print(judge)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }





int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    
    int n;
    cin >> n;
    string s;
    cin >> s;
    if (n % 2) { cout << "No" << endl; return 0; }
    string t = s.substr(0, n / 2);
    string u = s.substr(n / 2, n / 2);
    cout << (t == u ? "Yes" : "No") << endl;
}

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

    if n % 2 == 1:
        print("No")
        return

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


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
n=int(input())
s=input()
if n%2!=0:
  print("No")
  sys.exit()
for i in range(n//2):
  if s[i]!=s[n//2+1]:
    print("No")
    sys.exit()
print("Yes")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

N = int(input())
S = input()
a = list(str)
b = []
c = []
if N%2 == 0:
  for k in range(int(N/2)
        b.append(a[k])
        c.append(a[k+int(N/2)])
        if b == c:
            print("yes")
        else:
            print("No")
    else:
        print("No")

Submission status: Runtime Error

Solution code:
import sys
#input = sys.stdin.readline
input = sys.stdin.readline().rstrip()

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

Submission status: Runtime Error

Solution code:
def judge1(Num,a):
    s = list(range(Num+1))
    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[l] = 1
            else:
                s[l] = 0
        else:
            s[l] = 0
    return s


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

Submission status: Runtime Error

Solution code:
def judge1(Num,a):
    s = list(range(Num))
    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[l] = 1
            else:
                s[l] = 0
        else:
            s[l] = 0
    return s

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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 == a[0]:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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,A)
if 1 in a:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = [input().split() for i in range(N)]
T = S[0:N / 2 - 1]
 
if N >= 1 and N <=100:
	def S.islower():
	if True and T + T in s:
    	print('Yes')
    else:
  		print('No')

Submission status: Runtime Error

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: Runtime Error

Solution code:
s = list(map(input().split()))
n = len(s)
if n%2!=0:
  print('No')
  else:
    for i in range(0, n/2 + 1):
    if s[0 + i]==s[n/2 + i]:
      print('Yes')
    else:
      print('No')

Submission status: Runtime Error

Solution code:
import sys
import math
import itertools

n = int(sys.stdin.readline())
total = math.factorial(n)
res = 0
acc = 0
lines = []

for i in range(n):
    lines.append(sys.stdin.readline().rstrip('\n'))
for y in itertools.combinations(lines, 2):
    acc += ((int(y[0][0]) - int(y[1][0]))**2) + ((int(y[0][1]) - int(y[1][1]))**2)
    acc += math.sqrt(acc)

res = acc/total
print(res)

Submission status: Runtime Error

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

if N >= 1 and N <=100:
	def S.islower():
	if True:
      T = S[0:N / 2 - 1]
    else:
 
if (T + T in s):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
s = input()

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

Submission status: Runtime Error

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

if N >= 1 and N <=100:
	def S.islower():
	if True:
      T = S[0:N / 2 - 1]
    else:

if (T + T in s):
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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,S = input()

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
if len(S)==N:
    if N%2!=0:
        print("NO")
    else:
        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')

Submission status: Runtime Error

Solution code:
N=int(input())
S=input()
if len(S)==N:
    if N%2!=0:
        print("NO")
    else:
        for i in S:
            if S[0:int(len(S)/2)-1]==S[int(len(S)/2):len(S)-1]:
                x='ehehe'
            else:
                x='noob'
    if x=='ehehe':
        print('YES')
    else:
        print('NO')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

if (n !== len(t)): print("No")
else:
	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: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

T = S[0:N / 2 - 1]

if (T + T in s):
 print('Yes')
  
else:
 print('No')

Submission status: Runtime Error

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

T = S[0:N / 2 - 1]

if (T + T in s):
 print('Yes')
  
else:
 print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

if S[:N / 2] == S[N / 2:]:
  print('Yes')

Submission status: Runtime Error

Solution code:
def SsSl(): return list(map(lambda x: x, input()))

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

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

Submission status: Runtime Error

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

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

judge1(N,"S")

Submission status: Runtime Error

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

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

wc = N / 2
wc1 = S[:wc]
wc2 = S[wc:]

if wc1 == wc2:
  print('Yes')

Submission status: Runtime Error

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

n = int(N/2)
s1 = S[:n]
s2 = S[n:]

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

Submission status: Runtime Error

Solution code:
S = input()
N = input()
N = int(N/2)
S1 = S[:N]
S2 = S[N:]

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
S = input()
N = int(input())
N = int(N/2)
S1 = S[:N]
S2 = S[N:]

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

Submission status: Runtime Error

Solution code:
def SsSl(): return list(map(lambda x: x, input()))

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

if n%2==1:
    print('No')
else:
    if List[0:(n/2)]==List[(n/2):]:
        print('Yes')
    else:
        #print(List[0:(n/2)])
        #print(List[(n/2):])
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def nchars(S):
    """文字列 s に、同じ文字が n 個以上連続している部分文字列を見つける
    """
    reg = re.compile("(.)\\1{%d,}" % 1)  # カンマを取ると n 個ちょうどになる
    while True:
        m = reg.search(s)
        if not m:
            break
        yield m.group(0)
        s = s[m.end():]


print(list(nchars('a いい uuu ee お', 2)))
print(list(nchars('aa いいい ううううう e ooo', 3)))

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
 
n = N/2
na=n-1
nb=n+1
nc=N-1
s = S[0:na]
s2 =S[nb:nc]
 
if not N%2==0:
  print('No')
elif s==s2:
    print('yes')
else:
    print('no')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = list(map(input().split()))

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

Submission status: Runtime Error

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

v = [S[i:i+N//2] for i in range(0, len(S), 2)]


if N/2!=N//2:
  print("No")

if v[0] == v[1]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
def SsSl(): return list(map(lambda x: x, input()))

n = int(input())
#List = [s for s in input().split()]
List = SsSl()

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

Submission status: Runtime Error

Solution code:
n,s = (input().split())
n = int(n)
if n % 2 == 1:
    print("No")
else: 
    t = s[0 : n//2]
    if s[n//2: n] == t:
        print('Yes')
    else:
         print('No')

Submission status: Runtime Error

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

v = [S[i:i+N//2] for i in range(0, len(S), 2)]

if v[0] == v[1]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
i = int(input()) 
s = input()
if i >= 1 and 100 >= i and i % 2 == 0 and i == len(s) and s.isalpha() and s.islower():
  t_0 = s[0]
  t_1 = s[i/2]
    for j in range(1, i/2):
      t_0 += s[j]
    for k in range(i/2 + 1, i):
      t_1 += s[k]
    if t_0 == t_1:
      print("Yes")
    else:
      print("No")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = list(map(int, input().split()))

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
i = int(input())
if i >= 1 and 100 >= i and i % 2 == 0:  
  s = input()
    if i == len(s) and s.isalpha() and s.islower():  
      t_0 = s[0]
      t_1 = s[i/2]
	  for j in range(1, i/2):
	    t_0 += s[j]
      for k in range(i/2 + 1, i):
        t_1 += s[k]
      if t_0 == t_1:
        print("Yes")
      else:
        print("No")

Submission status: Runtime Error

Solution code:
n,s = (input().split())
n = int(n)
if n == 1:
    print("No")
else: 
    t = s[0 : n//2]
    if s[n//2: n] == t:
        print("Yes")
    else:
         print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
listnum = int(input())
string = input()

halfnum = listnum / 2
halfstr = string[0:halfnum]
if string == halfstr + halfstr:
	print('Yes')
else:
	print('No')

Submission status: Runtime Error

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

if N%2 == 0:
    jdg_1 = S[0:N/2]
    jdg_2 = S[N/2:N]
    if jdg_1==jdg_2:
      out = 'Yes'
    else:
      out = 'No'
else:
  out = 'No'

print(out)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
 
n = N/2
na=n-1
nb=n+1
nc=N-1
s = S[0:na]
s2 =S[nb:nc]
 
if not N%2==0:
  print('No')
else if s==s2:
    print('yes')
else:
    print('no')

Submission status: Runtime Error

Solution code:
i = int(input())
if i >= 1 and 100 >= i and i % 2 == 0:  
  s = input()
if i == len(s) and s.isalpha() and s.islower():  
  t_0 = s[0]
  t_1 = s[i/2]
	for j in range(1, i/2):
	  t_0 = t_0 + s[j]
    for k in range(i/2 + 1, i):
      t_1 = t_1 + s[k]
  if t_0 == t_1:
    print("Yes")
  else:
    print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
s = list(str(input()))
for i in range(int(n/2)+1):
  if s[i] != s[int(n/2+i)] or n==1 or n%2:
    print('No')
    exit()
print('Yes')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

    s_start = S[:N//2]
    s_end = S[N//2:]

    is s_start == s_end:
        print('Yes')
    else:
        print('No')
    return 0


if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys


def main(n: int, s: str):
    if n//2 != 0:
        print('No')

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


if __name__ == '__main__':
    args = [input() for i in range(2)]
    main(int(args[0]), args[1])

Submission status: Runtime Error

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

s_start = S[:N//2]
s_end = S[N//2:]
is s_start == s_end:
  print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
i = int(input())
if ( i >= 0 and 100 >= i and (i % 2 == 0) ):  
  s = input()
  t_0 = s[0]
  t_1 = s[i/2]
	for j in range(1, i/2):
	  t_0 = t_0 + s[j]
    for k in range(i/2 + 1, i):
      t_1 = t_1 + s[k]
  if (t_0 == t_1):
    print('Yes')
  else:
    print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

n = N/2
na=N+1
s = S[0:n]
s2 =S[na:N]

if not N%2==0:
  print('No')
else if s==s2:
    print('yes')
else:
    print('no')

Submission status: Runtime Error

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

s1 = ""
s2 = ""

if(n % 2 == 0):
    for i, st in enumerate(string):
        if i < n/2:
            s1 = s1 + st
        else:
            s2 = s2 + st

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
S = input()
if N%2==1:
    print('No')
else:
    for i in range(N//2):
        S1 += S[i]
    for j in range(N//2,N):
        S2 += S[j]
    if S1==S2:
        print('Yes')
    else:
        print('No')

Submission status: Runtime Error

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

Submission status: Runtime Error

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



if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

s1 = ""
s2 = ""

if(n % 2 == 0):
    for i st in enumerate(string):
        if i < n/2:
            s1 = s1 + st
        else:
            s2 = s2 + st

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
li=list(input())
t=n/2
if t%1:
  a=li[:t]
  b=li[:-t]
  for (i,j) in zip(a,b):
    if i==j:
    else:
      print('No')
      break
    print('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
n=int(input())
print(n**2)
#B
n=int(input())
s=list(str(input()))
if n % 2 ==0:
    ans=0
    for i in range(n//2):
        if s[i]==s[n//2+i]:
            ans+=1
        else:
            ans+=0

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

else:
    print('No')