Problem:


Score : 200 points

Problem Statement

Given are strings s and t of length N each, both consisting of lowercase English letters.

Let us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.

Constraints

1 \leq N \leq 100

|S| = |T| = N

S and T are strings consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S T

Output

Print the string formed.

Sample Input 1

2
ip cc

Sample Output 1

icpc

Sample Input 2

8
hmhmnknk uuuuuuuu

Sample Output 2

humuhumunukunuku

Sample Input 3

5
aaaaa aaaaa

Sample Output 3

aaaaaaaaaa



Sample input:
2
ip cc


Sample output:
icpc

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
for i,j in zip(s,t):
    print(i,j, sep='', end='')

Submission status: Accepted

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


def main():
    n = int(input())
    s, t = input().split()
    ans = ''

    for si, ti in zip(s, t):
        ans += si
        ans += ti

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
res = ""
for i in range(N):
    res += S[i]+T[i]
print(res)

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
result=''
for i in range(N):
  result+=S[i]+T[i]
print(result)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

ans = ""
for i in range(n):
  ans += s[i] + t[i]

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
X = []
 
for i in range(N):
  X.append(S[i])
  X.append(T[i])
  
print(''.join(X))

Submission status: Accepted

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

r = []
for s, t in zip(S, T):
  r.append(s)
  r.append(t)

print(''.join(r))

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

r = []
for i in range(n):
  r.append(s[i])
  r.append(t[i])

print(''.join(r))

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
U=str()
for i in range(N):
  U+=S[i]
  U+=T[i]
print(U)

Submission status: Accepted

Solution code:
N = int(input())

S, T = input().split()
x = ""
for i in range(N):
  x += S[i] + T[i]
print(x)

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str,input().split())
a = ""
for i in range(n):
  a = a + s[i] + t[i]
print(a)

Submission status: Accepted

Solution code:
n = int(input())
a,b = input().split()
c =""
for i,j in zip(a,b):
  c+=i+j
print(c)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

ans = ''.join(s[i] + t[i] for i in range(n))
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

merge = ''
for i in range(n):
  merge += s[i] + t[i]
  
print(merge)

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(str,input().split())
ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
str = input().split()

S = str[0]
T = str[1]

newStr = ''

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

print(newStr)

Submission status: Accepted

Solution code:
# B - Strings with the Same Length
N = int(input())
A, B = map(str, input().split())
ans = ''
for i in range(N):
    ans += A[i]
    ans += B[i]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = ""
for i in range(N):
    ans = ans + S[i] + T[i]
print(ans)

Submission status: Accepted

Solution code:
N = input()
S, T = input().split()
for s, t in zip(S, T):
    print(s+t, end = "")

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(str, input().split())
print( "".join([ S[i]+T[i] for i in range(0,N) ]) )

Submission status: Accepted

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

ans = ''.join([S[i] + T[i] for i in range(N)])
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
X = [x for x in input().split()]

res = ''

for i in range(N):
    res = res + X[0][i] + X[1][i]

print(res)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
print(''.join(s + t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
import sys

def main():

    # sys.stdin=open('input148b.txt')

    n = int(input())
    s, t = input().split()

    r = ''
    for i in range(n):
        r += s[i]
        r += t[i]

    print(r)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# ABC148 B

N = int(input())
S, T = input().split()

# res = ""

for i, j in zip(S, T):
    print(i, end='')
    print(j, end='')

print()

Submission status: Accepted

Solution code:
N = input()
S,T = map(str,input().split())
ans = ''

for i in range(len(S)):
    ans += S[i]
    ans += T[i]

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
x= []

for i in range(n):

    lst = [s[i], t[i]]
    x.append(''.join(lst))

print(''.join(x))

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()

L=[]
for i in range(n):
      L.append(s[i])
      L.append(t[i])
print(''.join(L))

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
U = ''
for i in range(len(S)):
    U += S[i]
    U += T[i]
print(U)

Submission status: Accepted

Solution code:
def solve(n, s, t):
    return "".join(a+b for a,b in zip(s,t))

n = int(input())
s, t = input().split()
print(solve(n, s, t))

Submission status: Accepted

Solution code:
N = int(input())
s,t = map(str,input().split())
S = list(s)
T = list(t)
Output = ""
for n in range(N):
  Output += S[n] + T[n]
print(Output)

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(str,input().split()))
r = ""
for i in range(n):
  r += a[0][i]+a[1][i]

print(r)

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
for i in range(n):
    print(s[i],end='')
    print(t[i],end='')

Submission status: Accepted

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

s=""
for i in range(N):
  s = s + S[i] + T[i]
  
print(s)

Submission status: Accepted

Solution code:


n=int(input())
s,t=input().split()
for i in range(n):
    print(s[i],t[i],sep="",end="")
print()

Submission status: Accepted

Solution code:
n = int(input())
s, t = (str(i) for i in input().split())
result = ''
for i in range(n):
  result += s[i] + t[i]
print(result)

Submission status: Accepted

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


class AtCoder:
    def main(self):
        N = int(input())
        S,T = input().split()

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

        print(ans)


# Run main
if __name__ == '__main__':
    AtCoder().main()

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
for i in range(n):
  print(s[i]+t[i],end='')

Submission status: Accepted

Solution code:
n = int(input())
a,b = map(str,input().split())
ans = ""
for i in range(n):
    ans += a[i]+b[i]
print(ans)

Submission status: Accepted

Solution code:
n, a, b = open( 0 ).read().split()

ans = ""
for i in range( int( n )):
  ans += a[ i ] + b[ i ]
  
print( ans )

Submission status: Accepted

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

str = ''
for i in range(N):
    str += list(S)[i] + list(T)[i]

print(str)

Submission status: Accepted

Solution code:
n = int(input())
word_one,word_second = input().split()
ans = ""
for i in range(n):
  ans += word_one[i] + word_second[i]
print(ans)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    S, T = input().split()
    ans = [None] * 2 * N
    for i in range(N):
        ans[i*2] = S[i]
        ans[i*2+1] = T[i]
    print("".join(ans))


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
s,t = map(str, input().split())
ans=""
for i in range(n):
    ans+=s[i]+t[i]
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A,B=map(str,input().split())
C=''
for i in range(N):
    C+=A[i]+B[i]
print(C)

Submission status: Accepted

Solution code:

N = int(input())

s, t = input().split(' ')

for i in range(N):
    print("{}{}".format(s[i], t[i]) , end='')

print()

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
for i in range(N):
    print(S[i],T[i],sep="",end="")
print()

Submission status: Accepted

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

s=list(S)
t=list(T)

for i in range(N):
  print(s[i],end="")
  print(t[i],end="")

print()

Submission status: Accepted

Solution code:
N = int(input()) 
a, b = map(str, input().split()) 
ans=''
for i in range(N):
    ans+= str(a[i])
    ans+= str(b[i])
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s = input().split()
a, b = s[0], s[1]
for i in range(n):
  print(a[i] + b[i], end="")

Submission status: Accepted

Solution code:
ans = ''
n = int(input())
li = list(map(str, input().split()))
for i in range(n):
  ans += li[0][i] + li[1][i]
print(ans)

Submission status: Accepted

Solution code:
N = input()
ST = input()
s = ST.split(" ")[0]
t = ST.split(" ")[1]
answer = ""
list(s)
list(t)
for (sn,tn) in zip(s,t):
    answer = answer + sn + tn
print(answer)

Submission status: Accepted

Solution code:
n = int(input())
S, T = input().split()

ans = ""
for i in range(n):
    ans += S[i] + T[i]

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
A,B=input().split()
for i in range(N):
  print(A[i]+B[i],end="")
print("")

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    row = input()
    for (s, t) in zip(row[:N+1], row[N+1:]):
        print(s+t, end="")
    print("") # 改行

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
N=int(input())
list =input()
S=list.split()[0]
T=list.split()[1]
ans=""
for n in range(N*2):
    if n % 2 == 0:
        ans+=str(S[int(n/2)])
    else:
        ans+=str(T[int(n/2)])
print(ans)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    row = input()
    S = row.split()[0]
    T = row.split()[1]
    result = ""
    for i in range(N):
        result += S[i]
        result += T[i]
    print(result)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

ans = ""
for i in range(n):
    ans =  ans + s[i] + t[i]

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
A=""
for i in range(N):
    A+=S[i]
    A+=T[i]
print(A)

Submission status: Accepted

Solution code:
N = int(input())
S, T =input().split()
a = ""
for i in range(N):
    a = a+S[i]+T[i]
print(a)

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
A=str()
for i in range(N):
  A+=S[i]
  A+=T[i]
print(A)

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    row = input()
    S = row.split()[0]
    T = row.split()[1]
    result = ""
    for (s, t) in zip(S, T):
        result += s
        result += t
    print(result)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n=int(input())
s,t = map(str,input().split(" "))
ans=list()

for i in range(n):
  ans.append(s[i])
  ans.append(t[i])
  
print("".join(ans))

Submission status: Accepted

Solution code:
n=int(input())
S,T=input().split()
for s,t in zip(S,T):
  print(s + t, end="")

Submission status: Accepted

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

N = int(input())
S, T = input().split()
res = "".join(s+t for s,t in zip(S,T))
print(res)

Submission status: Accepted

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


ans = ''
for i in range(N):
  ans = ans + S[i] + T[i]
  
print(ans)

Submission status: Accepted

Solution code:
def solve(string):
    n, s, t = string.split()
    return "".join(_s + _t for _s, _t, in zip(s, t))


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
def solve(string):
    n, s, t = string.split()
    return "".join([_s + _t for _s, _t, in zip(s, t)])


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str,input().split())
ans = ''
for i in range(n):
    ans += s[i] + t[i]

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

for i, j in zip(s, t):
    print(i+j, end="")

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(list, input().split())

for i in range(n):
  print(s[i], end = "")
  print(t[i], end = "")

Submission status: Accepted

Solution code:
A = int(input())
S = input().split()
R = ""
for i in range(A):
  R += S[0][i] + S[1][i]
print(R)

Submission status: Accepted

Solution code:
length = int(input())
words = input()
words = words.split()
new = []
for a,b in zip(words[0],words[1]):
  new += [a,b]
print("".join(new))

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
COM = ""

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

print(COM)

Submission status: Accepted

Solution code:
n = int(input())
s,t =input().split()

for i in range(n):
  print(s[i],end="")
  print(t[i],end="")

print("")

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
V=""
for i in range(N):
  V=V+S[i]+T[i]
print(V)

Submission status: Accepted

Solution code:
n = int(input())
s = list(map(str,input()))
ans = ''

for i in range(n):
  ans = ans + s[i] + s[i+n+1]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
ans = ""

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split(' ')
for i in range(n):
    print(s[i], end='')
    print(t[i], end='')

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
ans=""
S_li=list(S)
T_li=list(T)
for i in range(N):
    ans=ans+S_li[i]
    ans=ans+T_li[i]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, input().split())
ans = ""
for i in range(N):
	ans += S[i]
	ans += T[i]
print(ans)

Submission status: Accepted

Solution code:
_ = input()
a,b = input().split()
ans = ''
for i, s in enumerate(a):
  ans+=s
  ans+=b[i]
print(ans)

Submission status: Accepted

Solution code:
#input
N = int(input())
S, T = map(str, input().split())

#output
for i in range(N):
    print(S[i], T[i], sep = "", end = "")

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

answer = list()
for x, y in zip(s, t):
    answer.append(x + y)

print("".join(answer))

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
list1 = []
for i in range(n):
    list1.append(s[i])
    list1.append(t[i])

print("".join(list1))

Submission status: Accepted

Solution code:
N = int(input())
st = input().split()
S = st[0]
T = st[1]

for i in range(N):
  print(S[i], end="")
  print(T[i], end="")

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
an = ""
for i in range(n):
    an = an + s[i] + t[i]
print(an)

Submission status: Accepted

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

result = ''
for s, t in zip(S, T):
    result += s + t
print(result)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
l = ''
for i in range(n):
    l += s[i]
    l += t[i]
print(l)

Submission status: Accepted

Solution code:
def wczytaj_liste(): 
    wczytana_lista = input()
    lista_znakow = wczytana_lista.split()
    ostateczna_lista = []
    for element in lista_znakow:
        ostateczna_lista.append(int(element))
    return ostateczna_lista

def B_strings(): 
    N = wczytaj_liste()[0]
    wczytaj = input()
    S, T = wczytaj.split()
    odp = []
    for i in range(N): 
        odp.append(S[i])
        odp.append(T[i])
    print(''.join(odp))

B_strings()

Submission status: Accepted

Solution code:
n = int(input())
A, B = (x for x in input().split())

print("".join( map(lambda x: A[x//2] if x%2==0 else B[x//2], range(2*n)) ))

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
new = ''
for i in range(n):
    new += s[i]
    new += t[i]
print(new)

Submission status: Accepted

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

for i in range(n):
  print(s[i], end="")
  print(s[n+i+1], end="")

Submission status: Accepted

Solution code:
n = int(input())
a, b = input().split()

s = ""
for i in range(n):
    s += a[i]
    s += b[i]
print(s)

Submission status: Accepted

Solution code:
def s_gen():
    for x in S: 
        yield x
def t_gen():
    for x in T:
        yield x
        

N=int(input())
S,T=input().split()
S,T=S[:N],T[:N]

it=s_gen()
it2=t_gen()

print("".join([next(it)+next(it2) for _ in range(N)]))

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(list, input().split(" "))
a=[]
for i in range(n):
    a.append(s[i])
    a.append(t[i])
print(''.join(a))

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
result = ""
for i in range(n):
  result = result + s[i] + t[i]
print(result)

Submission status: Accepted

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

n = int(input())
s, t = input().split()

ans = ""
for i in range(n):
    ans += s[i]
    ans += t[i]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
ans = ""
for s,t in zip(S,T):
  ans += s + t
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
s,t=map(str,input().split())
d=""
for i in range(n):
  d+=s[i]
  d+=t[i]
print(d)

Submission status: Accepted

Solution code:
N = input()
S,T=map(str,input().split())

A=0
P=""
while A < int(N):
  P+=S[A]+T[A]
  A=A+1

print(P)

Submission status: Accepted

Solution code:
N=int(input())
A,B=map(str,input().split())
ANS=''
for a,b in zip(A,B):
  ANS = ANS + a + b
print(ANS)

Submission status: Accepted

Solution code:
n=int(input())
s,t=map(str,input().split())
ans=s[0]+t[0]
for i in range(1,n):
    ans+=s[i]+t[i]
print(ans)

Submission status: Accepted

Solution code:
input()
s, t = input().split()
print(''.join(a+b for a,b in zip(s,t)))

Submission status: Accepted

Solution code:
n = int(input())
a, b = [x for x in input().split()]
c = ""
for i in range(len(a)):
  c += a[i] + b[i]
print(c)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
ans = ""
for i in range(n):
  ans+=s[i]
  ans+=t[i]
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
a=str()
for i in range(N):
  a+=S[i]
  a+=T[i]
print(a)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = ''
for s, t in zip(S, T):
    ans += s + t
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
ans = ''
for i in range(n):
  ans += s[i] + t[i]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
 
a = ""
for i in range(N):
  a+=S[i]+T[i]
print(a)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
 
tmp = ""

for i, j in zip(S, T):
    tmp = tmp + i + j
print(tmp)

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, input().split())
ans = ""
for (s, t) in zip(S, T):
  ans += s + t
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s=list(input())
x=[]
for i in range(n):
    x.append(s[i])
    x.append(s[i+n+1])

print(*x, sep="")

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, input().split())
out = ''
for i in range(N):
    out += S[i] + T[i]
print(out)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ret = ""
for s, t in zip(S, T):
    ret += s + t
print(ret)

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str, input().split())
moji = ""

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

print(moji)

Submission status: Accepted

Solution code:
#coding:utf-8

n = int(input())
S, T = input().split(" ")

for i in range(n):
    print (S[i]+T[i],end="")
print ()

Submission status: Accepted

Solution code:
N = int(input())
S,T =input().split()
ans = ''
for i in range(N):
  letter = S[i]
  ans = ans + S[i]
  letter = T[i]
  ans = ans + T[i]
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
A,B=input().split()
C=""
for i in range(n):
  C+=A[i]
  C+=B[i]
print(C)

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
S, T = stdin.readline().rstrip().split()
for i in range(N):
    print(S[i]+T[i], end='')

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())

ans = ""
for x, y in zip(s, t):
    ans += x
    ans += y

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
ans = []
for ss,tt in zip(s,t):
  ans.append(ss+tt)
print(''.join(ans))

Submission status: Accepted

Solution code:
N = int(input())
n,m = map(str,input().split())

ans = str()

for i in range(N):
    ans += n[i]
    ans += m[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str, input().split())
out = ""
for i in range(n):
	out += s[i]
	out += t[i]
print (out)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
l = [0] * 2 * n
for i in range(0, 2*n, 2):
    l[i] = s[i//2]
    l[i+1] = t[i//2]
print(''.join(l))

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()

l=[0]*(2*n)

for i in range(0,2*n):
    if i%2==0:
        l[i]=s[i//2]
    else:
        l[i]=t[i//2]

print("".join(l))

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
ans=""
for s,t in zip(S,T):
  ans+=s
  ans+=t
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

for i in range(n):
  print(s[i]+t[i], end="")
print()

Submission status: Accepted

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

answer = []
for i in range(N):
    answer.append(S[i])
    answer.append(T[i])

print("".join(answer))

Submission status: Accepted

Solution code:
n = int(input())
temp = input().split()
s = list(temp[0])
t = list(temp[1])
i = 0
str = ''
while i < n:
  str = str + s[i] + t[i]
  i = i + 1

print (str)

Submission status: Accepted

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

A = N.split(" ")
B = A[0]
C = A[1]

D = ""

for num in range(S):
  D += B[num] + C[num]

print(D)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
for i in range(n):
  print(s[i], end='')
  print(t[i], end='')
print()

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
print("".join(S[i] + T[i] for i in range(N)))

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
res = ''

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

print(res)

Submission status: Accepted

Solution code:
n = int(input())
rawString = str(input())
splitString = rawString.split()
s = splitString[0]
t = splitString[1]

result = ""
for i in range(n):
  result += s[i]
  result += t[i]
print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n = int(input())
s, t = input().split()
ans = ""
for a, b in zip(s, t):
    ans += a + b
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
l=list(map(str,input().split()))
l[0]=list(l[0])
l[1]=list(l[1])
t=""
for i in range(n):
  t=t+l[0][i]
  t=t+l[1][i]
print(t)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    N = I()
    A, B = LS()
    ans = ''
    for i in range(N):
        ans += A[i]
        ans += B[i]
    print(ans)


main()

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())

st = ""

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

print(st)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = ""
for s, t in zip(S, T):
    ans += s + t
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()

ans = ''
for i in range(n):
	ans += s[i]
	ans += t[i]
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a,b=input().split()
s=""
for i in range(n):
  s=s+a[i]+b[i]
print(s)

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
ans=[]
for i in range(n):
    ans.append(s[i])
    ans.append(t[i])
print(''.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split(" ")
l = ""
for i in range(n):
  l += s[i]+t[i]
print(l)

Submission status: Accepted

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

r = []
for s, t in zip(S, T):
  r.append(s+t)

print(''.join(r))

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

r = []
for i in range(n):
    r.append(s[i])
    r.append(t[i])

print(''.join(r))

Submission status: Accepted

Solution code:
N = int(input())
st = list(input().split())
for i in range(len(st[0])):
    print(st[0][i], end="")
    print(st[1][i], end="")
print("")

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

r = ''
for a, b in zip(s, t):
    r += a + b
print(r)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = ""
for i in range(N):
    ans += S[i]
    ans += T[i]

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

newString = ''
for i in range(n):
    newString += s[i]
    newString += t[i]
    
print(newString)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


def LI(): return list(map(int, input().split()))


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(list, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


mod = 1000000007
inf = float('INF')

# solve


def solve():
    n = II()
    s, t = LS()
    for i in range(n):
        print("{}{}".format(s[i], t[i]), end="")
    print()
    return


# main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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

ans = ""


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


print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
ans=""
for i in range(n):
    ans+=s[i]+t[i]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
ans  = []
for i in range(N):
	ans.append(S[i])
	ans.append(T[i])
print("".join(ans))

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str,input().split())

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()

ans = ""
for i in range(n):
    ans += s[i] + t[i]

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, input().split())
ans = ""
for i in range(N):
    ans += S[i]
    ans += T[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
fin =[]
for i,p in zip(s,t):
    fin.append(i)
    fin.append(p)
print("".join(fin))

Submission status: Accepted

Solution code:
N = int(input())
n =2*N

S, T = input().split(" ")

s = 0
t = 0

for a in range(n):
    if a%2 == 0:
        print(S[s], end="")
        s = s +1
    else:
        print(T[t], end="")
        t = t + 1

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(str,input().split())
ans = ''
for i in range(N):
    ans = ans+S[i]+T[i]
print(ans)

Submission status: Accepted

Solution code:

from sys import exit

ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))


def main():
    n = ii()
    s,t = input().split()
    ns = ""

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

    print(ns)
    
main()

Submission status: Accepted

Solution code:
N = int(input())
S,T =input().split()
OUT = ''

for x in range(N):
  OUT += S[x] + T[x]


print(OUT)

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())

for i in range(n):
    print(s[i], end="")
    print(t[i], end="")

print("")

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
for i in range(n):
  print(s[i] + t[i], end='')

Submission status: Accepted

Solution code:
n=int(input())
hoge,huga=map(str,input().split())
for i in range(n):
  print(hoge[i],end="")
  print(huga[i],end="")
print("")

Submission status: Accepted

Solution code:
N = int(input())
S = input().split()
s, t = S[0], S[1]
for i, j in zip(s,t):
	print(i,j,sep='', end='')
print()

Submission status: Accepted

Solution code:
n=int(input())
a=''
t=input().split()
for i in range(n):
  a += t[0][i]+t[1][i]
print(a)

Submission status: Accepted

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

for i in range(N):
    print(S[i], end='')
    print(T[i], end='')

print('')

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
A, B= stdin.readline().rstrip().split() 

result = ""

for i in range(n):
  result += A[i]
  result += B[i]

print(result)

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(str, input().split())
ans = ""
for i in range(N):
    ans += S[i]
    ans += T[i]

print(ans)

Submission status: Accepted

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

ans = ''
for i in range(N):
    ans += S[i] + T[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
o = ""
for i in range(n):
  o += s[i]+ t[i]
print(o)

Submission status: Accepted

Solution code:
#abc148b

n=int(raw_input())
s,t=map(str,raw_input().split())
res=''
for i in range(n):
 res+=s[i]
 res+=t[i]
print res

Submission status: Accepted

Solution code:
N = int(input())
a,b = map(str,input().split())

c=""

for i in range(0,N):
  c += a[i]
  c += b[i]

print(c)