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

Solution (Python):
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)

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

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

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

result = ""

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

Solution (Python):
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))

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

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

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

Solution (Python):

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

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

ABC148B()

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

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

print(res)

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

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

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

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

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

Solution (Python):
N=int(input())
S,T=input().split()
ans=''

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

print(ans)

Solution (Python):
n = int(input())
a,b = input().split()
for _ in range(n):
  print(a[_],end='')
  print(b[_],end='')
print()

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

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

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

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

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

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

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

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

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

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

ans = ''

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

print(ans)

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

newstring = ""


for i in range(n):
    newstring += s[i]
    newstring += r[i]
print(newstring)

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

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

Solution (Python):


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


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

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

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

print(string)

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

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

print(ans)

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

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

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

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

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

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

print(ans)

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

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

print(res)

Solution (Python):
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()

Solution (Python):
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()

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

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

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

Solution (Python):
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)

Solution (Python):
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()

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

result=""

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

print(result)

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

ans = ''

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

Solution (Python):
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)

Solution (Python):
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()

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

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

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

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

ans = []

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

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

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

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

ans=""

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

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

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

Solution (Python):
n=int(input())
a,b=input().split()
c=""
for _ in range(n):
  c+=a[_]+b[_]
print(c)

Solution (Python):
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)

Solution (Python):
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)

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

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

Solution (Python):
a = int(input())
ar = input().split(" ")
b = ""
for i in range(a):
  b += ar[0][i]
  b += ar[1][i]
print(b)

Solution (Python):
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))

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

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

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

print(result)

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

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

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

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

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

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

res = ''

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

print(res)

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

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

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

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

Solution (Python):
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))

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

Solution (Python):
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)

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

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

Solution (Python):
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)

Solution (Python):
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)

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

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

print(res)

Solution (Python):
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)

Solution (Python):
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)

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

ans = ''

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

print(ans)

Solution (Python):


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

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

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

print(''.join(R))

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

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

print(result)

Solution (Python):
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))

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

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

print(result)

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

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

Solution (Python):
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))

Solution (Python):
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))

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

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

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

ans = ''

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

Solution (Python):
"""
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)

Solution (Python):
"""
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)

Solution (Python):
"""
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)

Solution (Python):
N =int(input())
S,T=input().split()
U=''

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

print(U)

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

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

print(new_str)

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

ret = ''

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

print(ret)

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

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

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

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

print(answer)

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

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

print(result)

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

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):


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))  
    S = next(tokens)  
    T = next(tokens)  
    solve(N, S, T)

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
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))

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

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

Solution (Python):
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()

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

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

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

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

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

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

Solution (Python):
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)

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

print(ans)

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

Solution (Python):

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

Solution (Python):

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


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


print(u)

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

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

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

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

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

Solution (Python):
_ = input()
print("".join(s + t for s, t in zip(*input().split())))

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

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

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

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

print(combine)

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

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

Solution (Python):

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

Solution (Python):
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)

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

r4 = ""

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

print(r4)

Solution (Python):
N = int(input())
s, t = map(list, input().split())

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

print(a)

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

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

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()
    s,t = LS()
    r = ""
    for i in range(n):
        r += s[i] + t[i]

    return r


print(main())

Solution (Python):

"""
Created on Sun Jan  5 10:06:24 2020

@author: masat
"""

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

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

print(answer)

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

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

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

ans = ''
for ss, tt in zip(s, t):
    ans += ss + tt
    
print(ans)

Solution (Python):
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)

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

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

print(out)

Solution (Python):
N = int(input())
S, T = input().split()
answer = ""

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

print(answer)

Solution (Python):

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

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

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






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

print(''.join(answer))

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

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

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

print(a)

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

for d in range(a):
    print(b[int(d)],end="")
    print(c[int(d)],end="")

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

S = list(S)
T = list(T)
answer = []

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

print("".join(answer))

Solution (Python):
from sys import stdin
import sys

def ria(sep = ''):
    if sep == '' :
        return list(map(int, input().split())) 
    else: return list(map(int, input().split(sep)))
def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()

def main():
    N = ri()
    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()

Solution (Python):
def fun(li,li2):
    for i in range(len(li)):
        print(li[i]+li2[i],end="")
x=int(input())
new=list(map(str,input().strip().split()))
li=new[0]
li2=new[1]
fun(li,li2)

Solution (Python):
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)

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

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

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

ST = S[0] + T[0]

for x in range(1 , N):
    ST = ST + S[x] + T[x] 

print(ST)

Solution (Python):
n = int(input())
s, t = input().split()
ans = ""
s = list(s)
t = list(t)
 
for ss, tt in zip(s, t):
    ans += ss
    ans += tt
 
print(ans)

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

for ss, tt in zip(s, t):
    ans += ss
    ans += tt

print(ans)

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

Solution (Python):
N = int(input())
Ar =list(map(str,input().split()))

S = list(Ar[0])
T = list(Ar[1])

Ans_Ar = []

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

result = ''.join(Ans_Ar)
print(result)

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

print(ans)

Solution (Python):


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

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

print(res)

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

Solution (Python):
def main():
    N = int(input())
    strings = input().split(" ")
    result = ""
    for i in range(0, N):
        result = result + strings[0][i] + strings[1][i]
    print(result)


if __name__ == '__main__':
    main()

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

Solution (Python):
N = int(input())
A,B = list(map(str,input().split()))
A = list(A)
B = list(B)
C = []
for i in range(N):
    C.append(A[i])
    C.append(B[i])
ans = ''.join(C)
print(ans)

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

print(''.join(ans))

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

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

Solution (Python):
'''input
2
ip cc
'''

from sys import stdin
from collections import defaultdict



n = int(stdin.readline().strip())
s, t = stdin.readline().split()
ans = []
for i in range(n):
	ans.append(s[i])
	ans.append(t[i])
print(''.join(ans))

Solution (Python):
N = int(input())
S,T = map(str,input().split())
ans = ""
for i in range(N*2):
    if i%2==0:
        ans += S[i//2]
    else:
        ans += T[i//2]
print(ans)

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

Solution (Python):
numN = int(input())
input_line = input().split(' ')
stS = input_line[0]
stT = input_line[1]

result = ""

for i in range(numN):
  result += stS[i] + stT[i]
  
print(result)

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

Solution (Python):



def main():
    
    n = int(input())
    s, t = input().split(' ')
    
    new = []
    for i in range(n):
        new.append(s[i])
        new.append(t[i])

    print(''.join(new))    
    
    return 0
    
    
    
if __name__ == '__main__':
    main()

Solution (Python):

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

    
    for i in range(n):
        sent += s[i] + t[i]
        
    print(sent)
    
    return 0
    
    
if __name__ == '__main__':
    main()

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

ans = ''

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

print(ans)

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

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

print(result)

Solution (Python):
n = int(input())

s,t = input().split()

moji = ""

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

print(moji)

Solution (Python):


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

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

Solution (Python):
input()
print("".join(sum(zip(*input().split()), ())))

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

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

U = ""

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

print(U)

Solution (Python):
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial
sys.setrecursionlimit(200000)
input = sys.stdin.readline

X, = map(int, input().split())







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

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

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

Solution (Python):
N = int(input())
A, B = input().split()

ans = []
for i in range(N):
        ans.append(A[i])
        ans.append(B[i])

print(''.join(ans))

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