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())

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S,T=list(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())
a, b = map(str,input().split())
ans = ""
for i in range(n):
  ans += a[i] + b[i]
print(ans)

Submission status: Accepted

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

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

ans = s[0]+t[0]

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

Submission status: Accepted

Solution code:
N = int(input())
S = list(input())
ans = ""
for i in range(N):
    ans += S[i]
    ans += S[N + i + 1]
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]+T[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

s, t = map(str, input().split())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

s = list(s)
t = list(t)

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())

s = list(s)
t = list(t)

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()
ansl = [S[i]+T[i] for i in range(N)]
ans = "".join(ansl)
print(ans)

Submission status: Accepted

Solution code:
#整数の入力
N = int(input())

#スペース区切りの整数の入力
S, T = map(str, input().split())

#listを一文字ずつのlistに
S_list = list(S)
T_list = list(T)

ans = ""
for i in range(N):
  ans = ans + S_list[i]
  ans = ans + T_list[i]
  
print(ans)

Submission status: Accepted

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

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 = []
for i in range(n):
    ans.append(s[i])
    ans.append(t[i])

ans = ''.join(ans)
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(str,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()
ans=["" for i in range(2*n)]
for i in range(n):
    ans[2*i]=s[i]
    ans[2*i+1]=t[i]
print("".join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

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 i in range(N):
    ans += S[i] + T[i]
print(*ans, sep="")

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()

S = list(S)
T = list(T)
A = []
for i in range(N):
    A.append(S[i])
    A.append(T[i])
print(''.join(A))

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:
A = int(input())
B, C = input().split()
D = ""
for i in range(A):
  E = B[i] + C[i]
  D = D + E
print(D)

Submission status: Accepted

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

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()
print(*[s+t for s,t in zip(S,T)],sep='')

Submission status: Accepted

Solution code:
N = int(input())

S, T = map(str, input().split())
S = list(S)
T = list(T)
word = []

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

print(''.join(word))

Submission status: Accepted

Solution code:
n = input()
S, T = input().split()
for i, j in zip(S, T):
    print(i, j, sep="", end="")

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=list(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 = map(str,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=(map(str,input().split()))
ans=""
for i in range(n):
  ans+=s[i]         
  ans+=t[i]
print(ans)
'''
ans=[]
ans.append(s[i])
ans.append(t[i])
ANS="".join(ans)
print(ANS)
でもよい.　　"XXXXX".join(ans)→各リストの要素を
XXXXXを加えながら一つの文字列に圧縮する。
.join(ans)にすると各要素をただただ一つの文字列にできる！！！！！！
# ans=""　無要素文字列のときは+で文字列を足せる
# ans=[]  無要素リストのときは.append()でリストの要素を足せる！'''

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=(map(str,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()
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()
S = [i for i in S]
T = [i for i in T]
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):
    for j in range(N):
        if i == j:
            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(N):
    U += S[i]
    U += T[i]

print(U)

Submission status: Accepted

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

Submission status: Accepted

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

a=[]

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

print(''.join(a))

Submission status: Accepted

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

print(solve())

Submission status: Accepted

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

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()

ans = [""]*(n+n)
ans[::2] = s
ans[1::2] = t
ans = "".join(ans)
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='')

Submission status: Accepted

Solution code:
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())
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 = []
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= map(str, input().split())

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

print(*st,sep="")

Submission status: Accepted

Solution code:
ans=""
n=input()
s,t=input().split()
for i in range(len(s)):
  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()

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()
res = ''
for i, j in zip(s, t):
    res += i + j
print(res)

Submission status: Accepted

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

str = list(s)
str1 = list(t)


i = 0

while i < num:
    str1.insert(i+i, str[i])
    i += 1

print(''.join(str1))

Submission status: Accepted

Solution code:
N = int(input())
S,T = map(list,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 = ""
for i in range(N):
    a = a+S[i]+T[i]
print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
i = 0
l = []
while i <= n - 1:
    l.append(s[i])
    l.append(t[i])
    i += 1
print(*l, sep="")

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 = input()
st = input().split()

ans = []
for i, j in zip(st[0], st[1]):
    ans.append(i)
    ans.append(j)

ans = ''.join(ans)
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = 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:
def solve():
    N = int(input())
    S, T = input().split()

    ans = ""
    for s_ch, t_ch in zip(S, T):
        ans += s_ch + t_ch
    print(ans)

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 += 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()

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

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()
for i in range(N) :
    print(S[i] + T[i], end="")
print()

Submission status: Accepted

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

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

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 = [''] * n * 2

step = 2
for i in range(n):
    idx = i * step
    ans[idx] = s[i]
    ans[idx+1] = t[i]

print(''.join(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 = [i for i in input().split(" ")]
ans = ""
for i,j in zip(S,T):
    ans+=(i+j)
print(ans)

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 = map(str, input().split())
ans = ''
for i in range(n):
    ans += s[i] + t[i]
print(ans)

Submission status: Accepted

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

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

    print(result)

if __name__ == "__main__":
    main()

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=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()
A=""
S,T=list(S),list(T)
for i in range(N):
    A=A+S[i]
    A=A+T[i]
print(A)

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:
from functools import reduce
N = int(input())
S,T = map(str,input().split())
res = ''
for i in range(len(S)):
    res = res + S[i] +T[i]
print(res)

Submission status: Accepted

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

Submission status: Accepted

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

p = []
p.append(s[0]+t[0])

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

print(p[0])

Submission status: Accepted

Solution code:
_ = input()
S,T = input().split()
print("".join(sum([[a,b] for a,b in zip(S, T)], [])) )

Submission status: Accepted

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

def main():
    N = int(input())
    s = input().strip().split()
    for i in range(N):
        print(s[0][i], end="")
        print(s[1][i], end="")
    print()


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
ST = input()
S = ""
for i in range(N):
  S += ST[i]
  S += ST[N+i+1]
print(S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=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()
ans=str()
for i in range (len(S)):
  ans=ans+S[i]+T[i]
print (ans)

Submission status: Accepted

Solution code:
import sys
import math
#ta= map(int,input().split())
ta=int(input())
li,li2= [str(x) for x in input().split()]
for i in range(ta):
  print(li[i]+li2[i],end="")

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())

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Mar  4 00:24:34 2020

@author: Kanaru Sato
"""

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

target = ""

for i in range(0,N):
    target = target + S[i]
    target = target + T[i]

print(target)

Submission status: Accepted

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

S=list(S)
T=list(T)


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

out2=''.join(out)
print(out2)

Submission status: Accepted

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd

# import numpy as np
# import scipy as scp

# 入力の受け取り
n = int(input())
s,t = input().split()

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

print(ans)

Submission status: Accepted

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

print(nw)

Submission status: Accepted

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

new = str()

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

print(new)

Submission status: Accepted

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

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()
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 += S[i]
    A += T[i]
print(A)

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())
word = input().split(" ")
S = word[0]
T = word[1]
for i in range(N):
    print(S[i]+T[i],end="")

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(list,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()
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 = ""
for s, t in zip(S, T):
  ans = ans + s + t

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, 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 = map(str, input().split())
ans = ""
for i in range(N):
  ans += s[i]
  ans += t[i]
print(ans)

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    ans = ""
    for s, t in zip(S, T):
        ans = ans + s + t
    print(ans)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(N, S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

U="".join(U)
print(U)

Submission status: Accepted

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

Submission status: Accepted

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

ans = ''
for i, j in zip(s, t):
	ans += i + j
print(ans)

Submission status: Accepted

Solution code:
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from sys import stdin
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
s,t = list(map(str, stdin.readline().rstrip().split()))
ans = ''
for i in range(N):
	ans += s[i] + t[i]
print(ans)

Submission status: Accepted

Solution code:
n=int(input())
s,t=list(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 = input()
s=a.split()[0]
t=a.split()[1]
ans=[]
for i in range(n):
    ans.append(s[i])
    ans.append(t[i])
print(*ans,sep="")

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

def main():
    n = int(input())
    s,t = list(map(str,input().split()))
    u = ''

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

    print(u)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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=int(input())
a,b=input().split(" ")
ans=" "
for i in range(0,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+=s[i]
    ans+=t[i]

print(ans)

Submission status: Accepted

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

def main():
    n = int(input())
    s, t = input().split()
    x = [s[i] + t[i] for i in range(n)]
    print("".join(x))

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]
    ans+=T[i]

print(ans)

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

a,b = input().split()

ab=[]

for i in range(N):
  ab.append(a[i] + b[i])
  
  
print("".join(ab))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
input = sys.stdin.buffer.readline
def inputS(): return input().rstrip().decode()
readlines = sys.stdin.buffer.readlines  

N = int(input())
S, T = inputS().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()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, input().split())
ST = zip(S,T)
res = ''
for i,j in ST:
    res += i+j
print(res)

Submission status: Accepted

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

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
    ls = []
    for i in range(n):
        ls.append(s[i])
        ls.append(t[i])
    print("".join(ls))


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 += s[i]
  ans += t[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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()
A=''
for x in range(N):
    A=A+S[x]+T[x]

print(A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
sLst, tLst = list(map(str, input().split()))
ans = str()

for i in range(n):
    ans = ans + sLst[i] + tLst[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main(n,s,t):
    res = ""
    for i in range(len(s)):
        res += s[i] + t[i]
    return res

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import fractions

integer = int(input())
num = list(input().split())
num_0 = list(num[0])
num_1 = list(num[1])

str = num_0[0] + num_1[0]
for i in range(1,integer):
  str = str + num_0[i] + num_1[i]

print(str)

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

for i, j in zip(s, t):
    ans = ans + i + j

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/02/21
# AtCoder Beginner Contest 148 - B

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

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

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('b1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    N = read_int()
    S, T = read_str_list()
    res = ''
    for i in range(N):
      res += S[i] + T[i]
    print(res)


main()

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
s_list=list(s)
t_list=list(t)
ans=[]
for i in range(n):
    ans.append(s_list[i])
    ans.append(t_list[i])
print(''.join(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=int(input())
s,t=map(str,input().split())
[print(s[i]+t[i],end="") for i in range(n)]

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())

S,T = [str(_) for _ in input().split()]

S_char =[ i for i in S]
T_char =[ i for i in T]
new_S = []
for i in range(2*N):
    if i%2 == 0:
        new_S = np.append(new_S,S_char[int(i/2)])
    elif i%2 != 0:
        new_S = np.append(new_S,T_char[int((i-1)/2)])
        
ans = str(''.join(map(str,new_S)))
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  input()
  s,t=input().split()
  for i in range(len(s)):
    print(s[i]+t[i],end="")

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()
#print(n,s,t)

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 = list(input().split())
c = []*n

for i in range(n):
  c.append(s[i])
  c.append(t[i])
  
print(*c, sep='')

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    result = ""
    for i in range(N):
        result = result + S[i] + T[i]
    print(result)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word

    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(N, S, T)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

st = S[0]+T[0]


for i in range(1,N):
    st += S[i]
    st += T[i]

print("%s"%(st))