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):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right 
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

n = inp()
s,t = input().split()
print(''.join([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):
def solve():
  N = int(input())
  S,T = input().split()
  ans = ''.join([s+t for s,t in zip(S,T)])
  return ans
print(solve())

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate, product 

from collections import deque,defaultdict,Counter
import decimal
import re












import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
n = I()
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)
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 in range(N):
    print(S[i], end='')
    print(T[i], end='')
print()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

N = ini()
S, T = ins().split()
assert len(S) == N
assert len(T) == N


def solve():
    res = []
    for i in range(N):
        res.append(S[i])
        res.append(T[i])
    return "".join(res)


print(solve())

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

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  = 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=input().split()
ans=""
for i,j in zip(list(s),list(t)):ans+=i+j
print(ans)

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

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

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

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

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

Solution (Python):


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


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

ans=''

for i in range(N):
    ans += S[i]
    for j in range(N):
        if i==j:
            ans +=T[j]
        
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())
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 = input().split()
ans = ''
for s, t in zip(list(S), list(T)):
    ans += s + t
print(ans)

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()
a=[]
for i in range(n):
    a+=[s[i]+t[i]]
print("".join(a))

Solution (Python):
import sys
input = sys.stdin.readline

n = int(input())
s, t = list(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 = input().split()
print(*[s+t for s,t in zip(S,T)],sep="")

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

Solution (Python):
N = int(input())
a,b = map(str,input().split())
a = list(a)
b = list(b)
name = ''
for i in range(N*2):
  if i%2==0:
    name+=a[int(i/2)]
  else:
    name+=b[int(i/2)]
print(name)

Solution (Python):

n = int(input())

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

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

Solution (Python):
N = int(input())
S, T = map(list, input().split(' '))
result = ''
for s, t in zip(S, T):
    result = result + s + t
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):
n = int(input())
s, t = input().split()
ans = ""
for i in range(n):
    ans = ans + s[i] + t[i]
print(ans)

Solution (Python):
N,S,T = open(0).read().split()
print(''.join([''.join(s) for s in zip(S,T)]))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

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

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

x,y = map(str,input().split())

ans = ''

for i in range(n):
    ans = ans + x[i] + y[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 = input().split()
x = ""
for i in range(N):
    x += S[i]+T[i]
print(x)

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

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

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

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 = 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()
list=[]
i=0
while i<N:
  list.append(S[i])
  list.append(T[i])
  i=i+1
print(*list, sep='')

Solution (Python):
n=int(input())
s=input().split()
a=s[0]
b=s[1]
ans=''
for i in range(len(a)):
  ans+=a[i]
  ans+=b[i]
print (ans)

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

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

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

print("".join(a_list))

Solution (Python):
N = int(input())
MM = input().split()
S = list(MM[0])
T = list(MM[1])
for i,j in zip(S,T):
  print(i,end='')
  print(j,end='')

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

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=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 = map(str,input().split())
slist = list(S)
tlist = list(T)
new = ''
for i in range(N):
    new += slist[i]
    new += tlist[i]
print(new)

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()
ans=""
for i in range(N):
  ans+=s[i]
  ans+=t[i]
  
print(ans)

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

s = moji[0]
t = moji[1]

a = '1'

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

Solution (Python):
def main():
    _ = int(input())
    S, T = input().split()

    ans = ''
    for a, b in zip(S, T):
        ans += a + b
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
S, T = input().split()
print(*[s+t for s,t in zip(S,T)], sep='')

Solution (Python):
N = int(input())
S, T = input().split()
print(*[s+t for s, t in zip(S, T)], sep='')

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

Solution (Python):
N=input()
S,T=input().split()
print(*[s+t for s,t in zip(S,T)],sep="")

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(' ')
q = ''

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

print(q)

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

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

main()

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

Solution (Python):
def solve():
    n = int(input())
    s, t = input().split()
    ans = ""
    for x, y in zip(s, t):
        ans = ans + x + y
    print(ans)



solve()

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

Solution (Python):
if __name__ == '__main__':
    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()
combination_of_letters = ''
for i in range(n):
    combination_of_letters += s[i] + t[i]

print(combination_of_letters)

Solution (Python):
n = int(input())
s, t = map(str,input().split())
ans = ['0']*(2*n)
for i in range(2*n):
    if i % 2 == 0:
        ans[i] = s[i//2]
    else:
        ans[i] = t[i//2]
print(''.join(ans))

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

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

if '__main__' == __name__:
    resolve()

Solution (Python):
n=int(input())
a,b=map(str,input().split())

for i,j in zip(a,b):
  print(i+j,end='')

Solution (Python):
n = int(input())
s, t = input().split()
print(*[si + ti for si, ti in zip(s, t)], sep='')

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

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

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

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

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

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

Solution (Python):
















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    N = int(lines[0])
    S, T = list(lines[1].split())
    
    
    
    
    
    
    
    

    result = ''

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

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['2', 'ip cc']
        lines_export = ['icpc']
    if pattern == 2:
        lines_input = ['8', 'hmhmnknk uuuuuuuu']
        lines_export = ['humuhumunukunuku']
    if pattern == 3:
        lines_input = ['5', 'aaaaa aaaaa']
        lines_export = ['aaaaaaaaaa']
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(2)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

print(*K,sep='')

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

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

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

print(word)

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

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

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

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

print(ans)

Solution (Python):
input();print(*[i+j for i,j in zip(*input().split())],sep='')

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

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 p in range(N):
    ans += S[p]
    ans += T[p]

print(ans)

Solution (Python):
n = input()
a, b = input().split(" ")
output = ""
for s, t in zip(a, b):
    output += s
    output += t
print(output)

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 = list()
    for i, j in zip(s, t):
        ans.append(i)
        ans.append(j)
    print(*ans, sep='')

if __name__ == '__main__':
    main()

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

Solution (Python):
n = int(input())
s, t = map(str, input().split())
ans = ''
for a, b in zip(s, t):
    ans += a+b
print(ans)

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

Solution (Python):
N = int(input())
S,T = 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()
list = []

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

Solution (Python):
N = int(input())
s,t = map(str,input().split())
ans = list()
for i in range(N):
  ans.append(s[i])
  ans.append(t[i])
  
for i in range(N*2):
  print(ans[i],end='')

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

print(res_str)

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

Solution (Python):


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

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

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

Solution (Python):
n = int(input())
s, t = input().split()
res = [a + b for a, b in zip(s, t)]
print(''.join(res))

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

Solution (Python):

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





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

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

if not ( 1 <= N <= 100 ): sys.exit()
if not ( len(S) == len(T) and len(S) == N ): sys.exit()
if not ( S.islower() and T.islower() ): sys.exit()

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

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

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

print(res)

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

def main():
  N = int(input())
  S, T = input().split()
  ans = ''
  
  for i in range(0, N):
    ans += S[i] + T[i]
    
  print(ans)
  
  
main()

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

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

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

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

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

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

print(A)

Solution (Python):
input()
print(''.join([s+t for s,t in zip(*input().split())]))

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

Solution (Python):
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

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

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

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

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

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

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())
a,b=map(str, input().split()) 
l = []

for i in range(n):
    l.append(a[i])
    l.append(b[i])

print(''.join(l))

Solution (Python):
n = int(input())
aa, bb = [i for i in input().split()]
ret = ''
for a, b in zip(aa, bb):
	ret = ret + a + b
print(ret)

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

for s, t in zip(S, T):
    answer.append(s)
    answer.append(t)

print(*answer, sep='')

Solution (Python):
n = int(input())
s, t = list(input().split(' '))
print(''.join([a+b for a,b in list(zip(s, t))]))

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

Solution (Python):
import os, sys, re, math

N = int(input())
(S, T) = [n for n in input().split()]

print(''.join(['%s%s' % (x, y) for (x, y) in zip(S, T)]))

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

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

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()
L = []
for i in range(2*N):
  if i&1:
    L.append(T[(i-1)//2])
  else:
    L.append(S[i//2])
print("".join(L))

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

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

print(''.join(x))

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

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

Solution (Python):
N = input()
S,T = input().split()
print(*[s+t for s,t in zip(S,T)],sep="")

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

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

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 stringWithTheSameLength(n, s, t):

    ans = ""

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

    return ans

def main():
    n = int(input())
    s, t = map(str, input().split())
    print(stringWithTheSameLength(n, s, t))

if __name__ == '__main__':
    main()

Solution (Python):
N=int(input())
a,b=input().split()
a=list(a)
b=list(b)
ab=""
for _ in range(N):
	ab+=a.pop(0)+b.pop(0)
print(ab)

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

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

for i in range(n):
  print(a[i], end='')
  print(b[i], end='')

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

ans = ''

for i in range(N):
  ans = ans + A[i] + B[i]
  
print(ans)

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

Solution (Python):
import sys 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
S,T = readline().decode().rstrip().split()
ans = ''
for i in range(N):
    ans += S[i] + T[i]
print(ans)

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())
S, T = read().decode('utf-8').rstrip().split()

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

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

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

print(ans)

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

joint = ''.join(answer_list)
print(joint)

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

n = k()
s,t = map(str,input().split())
a = []
for i in range(n):
    a.append(s[i]+t[i])

print("".join(a))

Solution (Python):
n=int (input())
a=list(input().split(" "))

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

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

Solution (Python):
import sys
input = sys.stdin.readline

n, (s, t) = int(input()), input()[:-1].split()
print(''.join(s[i] + t[i] for i in range(n)))

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

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

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

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

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

Solution (Python):
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n = int(input())
s,t = input().split()
ans = "".join(item[0]+item[1] for item in  zip(s,t))
print(ans)

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


if __name__ == '__main__':
    main()

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()
for s,t in zip(S,T):
  print(s+t,end="")

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

S, T = [x for x in input().split()]
result = []

while T:
    if len(S) == len(T):
        result.append(S[0])
        S = S[1:]
    else:
        result.append(T[0])
        T = T[1:]

print(''.join(result))

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

print(m[1::])

Solution (Python):


import copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

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

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))


N = int(input())
S, T = list(map(str, input().split()))


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

print("".join(ans))

Solution (Python):
a = int(input())
b, c = map(str, input().split())
d = ""
for i in range(0, a):
    e = b[i] + c[i]
    d += e
print(d)

Solution (Python):
N = int(input())
S, T = input().split()
ans = [0]*(N*2)
Scount = 0
Tcount = 1
for i in S:
    ans[Scount] = i
    Scount += 2
for j in T:
    ans[Tcount] = j
    Tcount += 2

print(''.join(ans))

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

ans = ""
for ss, tt in zip(s, t):
    ans += ss + tt
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 = 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()
for i in range(n):
    print(s[i],end='')
    print(t[i],end='')

Solution (Python):
N = int(input())
S,T = input().split()
print(''.join([X+Y for (X,Y) in zip(S,T)]))

Solution (Python):
N = int(input())
K, X = input().split()

print(*[K[i] + X[i] for i in range(N)], sep="")

Solution (Python):
input()
s, t = input().split()
for i,j in zip(s,t):
    print(i,j,sep='', end = '')

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


if __name__ == "__main__":
    solve()

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



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

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

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

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

ans=S

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

Solution (Python):
input()
print(''.join(sum(list(map(list, zip(*input().split()))), [])))

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

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

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

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

print(''.join(a))

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

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

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

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

print(char[::-1])

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

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

print(*char, sep='')