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:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

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

ans = ''
for (sc, tc) in zip(s, t):
    ans += sc
    ans += tc

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
s,t=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())

print("".join([s + t for s, t in zip(S, T)]))

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 = []
for i in range(N):
    ans.append(S[i])
    ans.append(T[i])


print(''.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
string1, string2 = input().split(" ")

for i in range(n):
    print(string1[i],end="")
    print(string2[i],end="")

Submission status: Accepted

Solution code:
N = int(input())
tmp = input()
S,T =tmp.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(" ")

res = [0]*(2*n)

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

print("".join(res))

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

ans = []
for i in range(N):
    ans.append(P[0][i])
    ans.append(P[1][i])

print("".join(ans))

Submission status: Accepted

Solution code:
n = int(input())

a = input().split()

res = ""
for i in range(n):
  res += a[0][i]
  res += a[1][i]
print(res)

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
s, t = input().split(" ")
str_list = []
for i in range(0, n):
  str_list.append(s[i])
  str_list.append(t[i])
print(''.join(str_list))

Submission status: Accepted

Solution code:
#!python3.4.3

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

num_s = 0
num_t = 0
for i in range(2*N):
    if i%2 == 0:
        c = S[num_s]
        print(c,end="")
        num_s += 1
    else:
        c = T[num_t]
        print(c,end="")
        num_t += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, 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()
ls = list()

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

print(*ls, 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 = map(str, input().split())
ans = []
for i in range(N):
  ans.append(S[i])
  ans.append(T[i])
mojiretu = ''.join(ans)
print(mojiretu)

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    _ = int(stdin.readline().rstrip())
    S, T = [x for x in stdin.readline().rstrip().split()]
    ans = ''
    for s, t in zip(S, T):
        ans += '{}{}'.format(s, t)
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC148 B
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
n=ni()
s,t=map(str, input().split())
ans=''
for i in range(n):
    ss=s[i:i+1]
    tt=t[i:i+1]
    ans+=ss
    ans+=tt
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(a)

Submission status: Accepted

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

ans=""
for s,t in zip(S,T):
    x=s+t
    ans+=x
print ans

Submission status: Accepted

Solution code:
from collections import deque

n = int(input())
S, T = map(deque, input().split())
st = ''

for i in range(n):
    s = S.popleft()
    t = T.popleft()
    st += s
    st += t

print(st)

Submission status: Accepted

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

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:
# 21:07
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 i in range(n):
    ans += s[i]
    ans += t[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N =int(input())

A,B = input().split()
s = ""
for i in range(N*2):
  if i%2 == 0:
    s+=A[i//2]
  else:
    s+=B[i//2]   
print(s)

Submission status: Accepted

Solution code:
import math
import random
from operator import itemgetter
import re
import sys
from itertools import accumulate
from collections import defaultdict
from collections import deque
from bisect import bisect_left,bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
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:
import sys

def solve(n, s, t):
    ans = ""
    for i, s_i in enumerate(s):
        ans += s_i + t[i]
    print(ans)

if __name__ == '__main__':
    n = sys.stdin.readline().strip()
    s, t = sys.stdin.readline().strip().split(" ")
    solve(n, s, t)

Submission status: Accepted

Solution code:
a=int(input())

s,t=list(map(str,input().split()))
for i in range(a):
    print(s[i],end="")
    print(t[i],end="")

Submission status: Accepted

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

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())
s, t = input().split(' ')

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

Submission status: Accepted

Solution code:
import sys


def main():
    n = int(input())
    l = list(sys.stdin.readline().split())
    s = ''
    for i in range(n):
        s += l[0][i]
        s += l[1][i]
    print(s)


main()

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
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 stdin 
n = int(stdin.readline().rstrip())
s,t = [x for x in stdin.readline().rstrip().split()]
a = []
for i in range(n):
    a.append(s[i])
    a.append(t[i])
a = ''.join(a)
print(a)

Submission status: Accepted

Solution code:
from sys import stdin


def fetch_one_line():
    return stdin.readline().rstrip()


def fetch_int_input():
    return [int(s) for s in fetch_one_line().split()]


def fetch_inputs(times):
    return [fetch_one_line() for _ in range(times)]


def fetch_int_inputs(times):
    return [[int(s) for s in fetch_one_line()] for _ in range(times)]

num = fetch_one_line()
first_sentence, second_sentence = fetch_one_line().split()

answer = ""
for s1, s2 in zip(first_sentence, second_sentence):
   answer += s1 + s2

print(answer)

Submission status: Accepted

Solution code:
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
import random
def I():
    return int(input())
def MI():
    return map(int,input().split())
def LI():
    return [int(i) for i in input().split()]
def LI_():
    return [int(i)-1 for i in input().split()]
def StoI():
    return [ord(i)-97 for i in input()]
def ItoS(nn):
    return chr(nn+97)
def GI(V,E,Directed=False,index=0):
    org_inp=[]
    g=[[] for i in range(n)]
    for i in range(E):
        inp=LI()
        org_inp.append(inp)
        if index==0:
            inp[0]-=1
            inp[1]-=1
        if len(inp)==2:
            a,b=inp
            g[a].append(b)
            if not Directed:
                g[b].append(a)
        elif len(inp)==3:
            a,b,c=inp
            aa=(inp[0],inp[2])
            bb=(inp[1],inp[2])
            g[a].append(bb)
            if not Directed:
                g[b].append(aa)
    return g,org_inp
def show(*inp,end='\n'):
    if show_flg:
        print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**5)
input=lambda: sys.stdin.readline().rstrip()

def ran_input():
    import random
    n=random.randint(4,16)
    rmin,rmax=1,10
    a=[random.randint(rmin,rmax) for _ in range(n)]
    return n,a

show_flg=False
show_flg=True
#for i in range(n):

ans=0

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

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


print(''.join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

str = sys.stdin.readlines()

n = int(str[0])
strs = str[1].split()
s = strs[0]
t = strs[1]

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

print(string)

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:
num = int(input())

string = input().split(' ')
result = ''
for i in range(len(string[0])):
    result += string[0][i] + string[1][i]

print(result)

Submission status: Accepted

Solution code:
n=int(input())
s, t =input().split()
new=''
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())

st = ''

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

Submission status: Accepted

Solution code:
n=int(input())
x,y=input().split()
z=''
for i in range(n):
  z+=x[i]
  z+=y[i]
print(z)

Submission status: Accepted

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

X = str('')

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

print(X)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc148/tasks/abc148_b
import sys


def main():
    num = int(input())
    (s, t) = input().split(" ")
    for i in range(num):
        sys.stdout.write(s[i])
        sys.stdout.write(t[i])
    sys.stdout.write("\n")


if __name__ == '__main__':
    main()

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:
input()
def ststst(st):
    s, t = st
    s = iter(s)
    t = iter(t)
    while True:
        yield next(s)
        yield next(t)
print(''.join(ststst(input().split())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
test = ""
#test = \
"""
8
hmhmnknk uuuuuuuu
"""
test = list(reversed(test.strip().splitlines()))
if test:
    def input2():
        return test.pop()
else:
    def input2():
        return input()
    

n = int(input2())
a, b = input2().strip().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()
str=''
for i in range(n):
    str=str+s[i]+t[i]
print(str)

Submission status: Accepted

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

char_lists = []

for i,char in enumerate(S):
    char_lists.append(char)
    char_lists.append(T[i])

print("".join(char_lists))

Submission status: Accepted

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

result = ''

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

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
k = S[0]
for i in range(1,2*N):
    if i % 2 == 0:
        k += S[int(i/2)]
    else:
        k += T[int(i/2)]
print(k)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

print(kotoba)

Submission status: Accepted

Solution code:
n=int(input())
s,t=map(list,input().split())
o=[]
for i in range(n*2):
    if i%2==0:
        o.append(s[i//2])
    else:
        o.append(t[i//2])

print(''.join(o))

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 = map(list, input().split())

s = []

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

print("".join(s))

Submission status: Accepted

Solution code:
n = int(input())
a, b = 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 = 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()
st = ""
for i,j in zip(list(s),list(t)):
    st += i+j
print(st)

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:
res = ''
N = int(input())
S,T = map(str,input().split())
j = 0
while j < N:
    for i in range(N):
        res = res + S[i]
        res = res + T[j]
        j = j+1
print(res)

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(list,input().split())
Newlist = []
for i in range(N):
    Newlist.append(S[i])
    Newlist.append(T[i])
New = ('').join(Newlist)
print(New)

Submission status: Accepted

Solution code:
def main(n: int, s: str, t: str):
    ans = str()
    for i in range(n):
        ans += s[i]
        ans += t[i]

    print(ans)


if __name__ == "__main__":
    n = int(input())
    s, t = input().split()

    main(n, s, t)

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 = [ v for v in input().split() ]


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

print(ans)

Submission status: Accepted

Solution code:
##B
n = int(input())
s,t = map(str,input().split())
ans = str()
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=x+s[i]+t[i]
print(x)

Submission status: Accepted

Solution code:
N = int(input())
A = [i for i in input().split()]
result = ''

for i in range(N):
  result = result + A[0][i] + A[1][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())
l = list(input().split())

ans = ""
for i in range(n):
  ans += l[0][i]
  ans += l[1][i]
  
print(ans)

Submission status: Accepted

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

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

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

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:
n = int(input())
s1, s2 = input().split()
result = ""
for i in range(n):
    result = result + s1[i] + s2[i]
print(result)

Submission status: Accepted

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

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 = list(input().split())
s = list(s)
t = list(t)

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
f_i = stdin

N = int(f_i.readline())

S, T = f_i.readline().split()

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

Submission status: Accepted

Solution code:
n = int(input())
b = input().split()
s = b[0]
t = b[1]
p = []
for q in range(n):
 p.append(s[q])
 p.append(t[q])
#print(p)
r = ""
for x in p:
    r += x
print(r)

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

ans = ""

for i in range(0,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]
    ans += T[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
get = input().split()
S = get[0]
T = get[1]
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())
cnt = 0
ans = ''
while cnt < N:
  ans += S[cnt] + T[cnt]
  cnt += 1

print(ans)

Submission status: Accepted

Solution code:
# print('input >>')
N = int(input())
S, T = input().split()

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

Submission status: Accepted

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

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

str = []
for i in range(n):
    # print(i)
    str.append(s[i])
    str.append(t[i])

print(''.join(str))

Submission status: Accepted

Solution code:
import sys

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
S_MAP = lambda: map(str, INPUT().split())

sys.setrecursionlimit(10 ** 9)


def main():
    N = INT()
    S, T = S_MAP()

    ans = ""
    for s, t in zip(S, T):
        ans += s + t

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n,s,t=open(0).read().split()
print(*[i+j for i,j in zip(s,t)],sep="")

Submission status: Accepted

Solution code:
def acinput():
    return list(map(int, input().split(" ")))



N=int(input())

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

res=""

for ss in zip(s,t):
    res+=ss[0]
    res+=ss[1]

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

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

O = ["a" for a in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
b = input().split()
c = ""
for i, k in zip(list(b[0]), list(b[1])):
    c += i
    c += k
print(c)

Submission status: Accepted

Solution code:
N, *L,  = [s.split() for s in open(0)]
L = L[0]
string = ""
for i in range(int(N[0])):
    string += L[0][i]
    string += L[1][i]
print(string)

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:
import sys
import math
input = sys.stdin.readline


def main():
    sc = Scan()
    n = sc.intarr()[0]
    s, t = sc.strarr()
    text = ''

    for ss, tt in zip(s, t):

        text = text + ss
        text = text + tt

    print(text)


class Scan():

    def intarr(self):
        line = input()
        array = line.split(' ')
        num_array = [int(n) for n in array]
        return num_array

    def intarr_ver(self, n):
        return [int(input()) for _ in range(n)]

    def strarr(self):
        line = input()
        array = line.split(' ')
        array[-1] = array[-1].strip('\n')
        return array


def display(array):
    for a in range(len(array)):
        if len(array) - a != 1:
            print(array[a], end=' ')
        else:
            print(array[a])


def gcd(a, b):
    while b:
        a, b = b, a % b
    return a


def natural_num(n):
    for j in range(2, int(math.sqrt(n))+1):
        if n % j == 0:
            return 0
    return 1


main()

Submission status: Accepted

Solution code:
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue
#import numpy as np
#import sympy as syp(素因数分解とか)
Mod = 1000000007
import sys

sys.setrecursionlimit(100000) 
  
def sieve_of_eratosthenes(n):
    if not isinstance(n,int):
        raise TypeError("n is not int")
    if n<2:
        raise ValueError("n is not effective")
    prime = [1]*(n+1)
    for i in range(2,int(math.sqrt(n))+1):
        if prime[i] == 1:
            for j in range(2*i,n+1):
                if j%i == 0:
                    prime[j] = 0
    res = []
    for i in range(2,n+1):
        if prime[i] == 1:
            res.append(i)
    return res

def factorial(i):
    if i == 1:
        return 1
    else:
        return i*factorial(i-1)
 
class UnionFind:
    def __init__(self,n):
        self.parent = [i for i in range(n+1)]
        self.rank = [0 for i in range(n+1)]
    
    def findroot(self,x):
        if x == self.parent[x]:
            return x
        else:
            y = self.parent[x]
            y = self.findroot(self.parent[x])
            return y
    
    def union(self,x,y):
        px = self.findroot(x)
        py = self.findroot(y)
        if px < py:
            self.parent[py] = px
        else:
            self.parent[px] = py
 
    def same_group_or_no(self,x,y):
        return self.findroot(x) == self.findroot(y)




def main(): #startline-------------------------------------------- 
    n = int(input())
    s,t = input().split()
    ans = []
    for i in range(n):
        ans.append(s[i])
        ans.append(t[i])
    print("".join(ans))



if __name__ == "__main__":
    main() #endline===============================================

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data1 = int(input())
data2 = input().split()
string = ''
for i in range(0,data1):
    string += str(data2[0][i]) + str(data2[1][i])
print(string)

Submission status: Accepted

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

ret = ""

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

Submission status: Accepted

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

Submission status: Accepted

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

string = ""
for i in range(N):
    string = string + a[i]
    string = string + b[i]
print(string)

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

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

print(ans)

Submission status: Accepted

Solution code:
INF = float("inf") #const
MOD = 10**9+7 #const
MAX = 510000 #const

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


if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

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

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()
print(''.join(c + d for c, d in zip(s, t)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np

N = int(input())

data = input().split()

for i in range(N):
	print(data[0][i], end="")
	print(data[1][i], end="")

Submission status: Accepted

Solution code:
import numpy as np

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:
def main():
	n = int(input())
	# b = int(input())
	s,t = list(map(str,input().split()))
	# A = [list(map(int, input().split())) for _ in range(H)]
	s = list(s)
	t = list(t)

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

	print(ans)

	




if __name__ == '__main__':
	main()