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

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

Submission status: Accepted

Solution code:
import sys
 
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
 
 
n=int(input())

s,t=input().split()

k=""

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print("".join(map("".join, zip(a, b))))

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
new_str = ''
for si, ti in zip(s, t):
    new_str += si + ti
print(new_str)

Submission status: Accepted

Solution code:
n=int(input())
a,b=map(str,input().split())
c=list(a)
d=list(b)
e=[]
for i in range(n):
    e.append(c[i])
    e.append(d[i])
print(''.join(e))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#148
n = int(input())
s,t = input().split()
res = ""
for i in range(0, n):
    res += s[i] + t[i]
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=input().split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    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 = list(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()
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()

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

Submission status: Accepted

Solution code:
from itertools import chain

N = int(input())
S, T = input().split()
print("".join(chain(*zip(S, T))))

Submission status: Accepted

Solution code:
from itertools import chain

N = int(input())
S, T = input().split()
print("".join(list(chain(*zip(S, T)))))

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
# -*- coding utf-8 -*-

# 普通に解く

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

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

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())
sList = list(input().split())
scList = []
for i in range(n):
  scList.append((sList[0]+sList[1])[i])
  scList.append((sList[0]+sList[1])[i+n])

print(''.join(scList))

Submission status: Accepted

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

Submission status: Accepted

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

res = ""

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
my_str = input()
s, t = my_str.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 = input().split()

ret = ''

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

print(ret)

Submission status: Accepted

Solution code:
n = int(input())
st = input().split()
print(*[st[0][i] + st[1][i] for i in range(n)], sep="")

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 = list(map(str, 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()
for i in range(n):
    if i==0:
        ans=s[i]+t[i]
    else:
        ans+=s[i]+t[i]
print(ans)

Submission status: Accepted

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

answer = ""

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

Submission status: Accepted

Solution code:
n=input()
ans=''
for i,j in zip(*input().split()):
    ans+=i+j
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

result = ""

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

Submission status: Accepted

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

result=[]
for i in range(0,len(s)):
    result.append(s[i])
    result.append(t[i])
print("".join(result))

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()
d=''
for i in range(n):
  d+=s[i]
  d+=t[i]
print(d)

Submission status: Accepted

Solution code:

def ABC148B():
    N = int(input())
    S, T = input().split()

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

ABC148B()

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 = (s for s in 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()

tmp = [x+y for x,y in zip(S,T)]
ans = "".join(tmp)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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 _ in range(n):
  print(a[_],end='')
  print(b[_],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:
n = int(input())
s, t = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
st = input()
st_split = st.split(" ")
s = st_split[0]
r = st_split[1]

newstring = ""
#zに文字を足していく
#リストS、Tについて繰り返しを用いて1文字ずつ抽出し、リストに足していく
for i in range(n):
    newstring += s[i]
    newstring += r[i]
print(newstring)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
import numpy as np
import collections

#X = str(raw_input()).split()
N = int(raw_input())
ST = str(raw_input()).split()
S = ST[0]
T = ST[1]
ans = ""

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

print(ans);

Submission status: Accepted

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

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

print(string)

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

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

Solution code:
import sys
 
def main():
    N = int(input())
 
    S, T = map(str, input().split())
    
    for i in range(N):
        print("{0}{1}".format(S[i], T[i]), end="")
 
main()

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

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

ans2 = ''.join(ans)


print(ans2)

Submission status: Accepted

Solution code:
import os

def main():
    strings = ""
    count = int(input())
    a,b = input().split()
    a = list(a)
    b = list(b)
    for i in range(count):
        strings = strings + a[i] + b[i]
    print(strings)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

result=""

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

print(result)

Submission status: Accepted

Solution code:
n = int(input())
s,t = 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=list(input().split())
i=0
U=''
for i in range(N):
  U=U+S[i]+T[i]
  i+=1

print(U)

Submission status: Accepted

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

    result = ''
    s_list = list(S)
    t_list = list(T)

    for i in range(N):
        result += s_list[i]
        result += t_list[i]


    print(result)

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

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

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())
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())
a, b = 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=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=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=input().split()
c=""
for _ in range(n):
  c+=a[_]+b[_]
print(c)

Submission status: Accepted

Solution code:
a = int(input())
b,c = input().split()
count = 0
for i in range(a):
    if count == 0:
        d = b[0]+c[0]
        count = 1
    else:
        d = d + b[i]+c[i]
print(d)

Submission status: Accepted

Solution code:
class AC:
    @staticmethod
    def inputStr(char):
        return input().split(char)
    
    @staticmethod
    def inputInt(char):
        a = input().split(char)
        for i in range(len(a)):
            a[i] = int(a[i])
        return a

N = int(input())
inp = AC.inputStr(" ")
S = inp[0]
T = inp[1]

stack = ""

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

print(stack)

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:
a = int(input())
ar = input().split(" ")
b = ""
for i in range(a):
  b += ar[0][i]
  b += ar[1][i]
print(b)

Submission status: Accepted

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

ans = list()
for a, b in zip(S, T):
    ans.append(a)
    ans.append(b)

print(''.join(ans))

Submission status: Accepted

Solution code:
N = int(input())
x,y = input().split()
for a,b in zip(x,y):
  print(a+b,end="")

Submission status: Accepted

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

result = ''
for idx in range(n):
  result += s[idx] + t[idx]

print(result)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
A = ''
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:
n = int(input())
s,t = input().split()
count = "0"
for i in range(n):
    count += s[i]+t[i]
print(count[1:])

Submission status: Accepted

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

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

Submission status: Accepted

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

res = ''

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a, b = input().split()
for _a, _b in zip(a, b):
    print(_a + _b, end="")

Submission status: Accepted

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

for _s, _t in zip(s, t):
    print(_s+_t, end="")
print()

Submission status: Accepted

Solution code:
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')


N = int(input())
S,T = inpl_str()


ans = list()

for _ in range(N):
    ans.append(S[_])
    ans.append(T[_])

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

Submission status: Accepted

Solution code:
n = int(input())

word_list = list(map(str, input().split()))

result_string = ""
for num in range(len(word_list[0])):
    for i in range(0,2):
        word_selected = word_list[i]
        result_string += word_selected[num]

print(result_string)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(u)

Submission status: Accepted

Solution code:
A = int(input())
input2 = input()
L1 = input2.split()[0]
L2 = input2.split()[1]

L3 = ""

for i in range(A):
    L3 += L1[i]
    L3 += L2[i]
    
print(L3)

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
no_of_lines = 2
lines = ""
for i in range(no_of_lines):
    lines+=input()+"\n"

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

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

print(new_str)

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:
# -*- coding:utf-8 -*-

def solve():
    N = int(input())
    S, T = input().split()

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


if __name__ == "__main__":
    solve()

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

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

print(result)

Submission status: Accepted

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

listb = list(b)
listc = list(c)
listd = []

for i in range(a):
  listd.append(listb[i])
  listd.append(listc[i])

print(''.join(listd))

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
num = input()
s, t = input().split()
for j, k in zip(s, t):
    print(j + k, end='')

Submission status: Accepted

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

Submission status: Accepted

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

list_S = list(S)
list_T = list(T)
list_NEW =[]

for i in range(N):
    list_NEW.append(list_S[i])
    list_NEW.append(list_T[i])

print(''.join(list_NEW))

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ''

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

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 8, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = int(readline())
S, T = readline().decode('utf-8').split()

C = [None] * (A+A)
C[::2] = S
C[1::2] = T

ans = ''.join(C)

print(ans)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 8, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = int(readline())
S, T = readline().decode('utf-8').split()

C = [None] * (A * 2)
C[::2] = S
C[1::2] = T

ans = ''.join(C)

print(ans)

Submission status: Accepted

Solution code:
"""
author : halo2halo
date : 8, Jan, 2020
"""

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

A = int(readline())
S,T=readline().decode('utf-8').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()
U=''

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

print(U)

Submission status: Accepted

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

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

print(new_str)

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())
slis,tlis=list(input().split())
alis=[]
for i in range(n):
	alis.append(slis[i])
	alis.append(tlis[i])
print(*alis,sep="")

Submission status: Accepted

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

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
n=int(input())
s,t=map(list,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()
for i in range(n):
  print(s[i],t[i],sep='',end='')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
_ = input()
A, B = map(list, input().split())

for i in zip(A,B):
	print(i[0] + i[1], end = "")

Submission status: Accepted

Solution code:
_ = input()
A, B = map(list, input().split())

for i in range(len(A)):
	print(A[i], end = "")
	print(B[i], end = "")

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)


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

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

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

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

str_result = []
for i in range(N):
  str_result.append(str1[i])
  str_result.append(str2[i])
  
print(''.join(str_result))

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

Submission status: Accepted

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

    S_list = list(S)
    T_list = list(T)

    answer = ""

    for i in range(N):
        answer += S_list[i]
        answer += T_list[i]

    print(answer)
    
 
if __name__ == "__main__":
    resolve()

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

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

Submission status: Accepted

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

for i in range(n):
    ans = ans + s[i]
    ans = 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:
# -*- coding: utf-8 -*-
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:
# input
n = int(input())
s , t = list(input().split())

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

# output
print(u)

Submission status: Accepted

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

for _s, _t in zip(s, t):
    print(_s + _t, end="")
print()

Submission status: Accepted

Solution code:
n = int(input())
s = input().split()
s1 = [_ for _ in s[0]]
s2 = [_ for _ in s[1]]

for i in range(n):
  s = ''.join([s1[i],s2[i]])
  print(s,end="")

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:
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:
_ = input()
print("".join(s + t for s, t in zip(*input().split())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(combine)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC148B - Strings with the Same Length
def main():
    N = int(input())
    S, T = input().split()
    ans = ""
    for i in range(N):
        ans += S[i] + T[i]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

b = ""

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

Submission status: Accepted

Solution code:
n1 = int(input())
s2, s3 = [i for i in input().split()]

r4 = ""

for i5 in range(n1):
    r4 += s2[i5] + s3[i5]

print(r4)

Submission status: Accepted

Solution code:
N = int(input())
s, t = map(list, 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 =map(list,input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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