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

ans = ''

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

print(ans)

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
a,b = [x for x in stdin.readline().rstrip().split()]
ns = ""
for i in range(n):
    ns += a[i]
    ns += b[i]
print(ns)

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

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

mojiretsu = input()
S, T = mojiretsu.split(" ")

newmojiretsu = []

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

print("".join(newmojiretsu))

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

ans = [""]*(N*2)
id = 0
for i in range(2*N):
    if i % 2 == 0:
        ans[i] = S[id]
    else:
        ans[i] = T[id]
        id += 1
print("".join(ans))

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n =INT()
    a,c =LISTS()
    b = []
    for i in range(n):
        b.append(a[i])
        b.append(c[i])
    print(*b, sep='')
if __name__ == '__main__':
    do()

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

mylist = [1,2,3]

myans = ''

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

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

a = input().split()

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

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

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

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


if __name__ == "__main__":
    main()

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

Solution (Python):

def solve():
    input()
    return ''.join(map(''.join, zip(*input().split()),))

if __name__ == '__main__':
    print(solve())

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

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

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

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

input_1, input_2 = input().split()

ans = ""
for i in range(0, len_str):
    ans = ans + input_1[i] + input_2[i]

print(ans)
exit(0)

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

print(''.join(d))

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

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

ans = "".join(xs)
print(ans)

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

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

for s in ST:
    print(s, end = '')

Solution (Python):


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

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

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()
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):
n = int(input())
a, b = input().split(' ')
res = ''
for i in range(n):
    res += a[i]
    res += b[i]
print(res)

Solution (Python):
import sys
def I(): return int(sys.stdin.readline())
def LI(): return [int(x) for x in sys.stdin.readline().split()]

def main():
    N = I()
    S,T = sys.stdin.readline()[:-1].split()

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

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
N = int(input())
inf = input().split()
s = inf[0]
t = inf[1]
ans = ''
for i in range(2*N):
  if i%2==0:
    j = i//2
    ans += s[j]
  else:
    j = (i-1)//2
    ans += t[j]

print(ans)

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

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

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

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

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

print()

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

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

ans = []
for i in range(N):
  ans.append(S[i])
  ans.append(T[i])
  
print(''.join(map(str, 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):
import sys
n = int(sys.stdin.readline())
S, T = sys.stdin.readline().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 s, t in zip(S, T):
    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]+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):
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()

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

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

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):
def samelen(s):
    s1, s2 = s[1].split()
    ans = ""
    for i, j in zip(s1, s2):
        ans += i + j
    print(ans)

if __name__ == "__main__":
    import sys
    in_str = []
    for line in sys.stdin:
        in_str.append(line)
    samelen(in_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):
n = int(input())
s,t = map(str, input().split())
ans = ""
for i in range(2*n):
    if i%2==0:
        ans +=s[i//2]
    else:
        ans += t[(i-1)//2]
print(ans)

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

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


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

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

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

print(''.join(ans))

Solution (Python):
n = int(input())
N, K = [x for x in input().split()]
for i in range(n):
  print(N[i],end="")
  print(K[i],end="")

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

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

print(ret)

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

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

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

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

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

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

s = "".join(i+j for i, j in zip(S, T))
print(s)

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

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


def main():
    N = int(input())
    S, T = input().strip().split()
    for i in range(len(S)):
        print(S[i] + T[i], end="")








    
    


if __name__ == '__main__':
    main()

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

[s,t]=input().split()

for g in range(N):
	print(s[g]+t[g],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):
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
a,b = Ss()
for e in [a[i]+b[i] for i in range(N)]:
    print(e,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):
if __name__ == "__main__":
	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+=s[i]+t[i]
print(ans)

Solution (Python):
N = int(input())
S , T = map(list , 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 _s, _t in zip(s, t):
    ans += _s+_t
print(ans)

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

ss = ''

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

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

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

Solution (Python):
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))



N = I()
x = str(input())

S = x[:N]
T = x[N+1:]
c = str()
for i in range(N):
    c += S[i]
    c += T[i]

print(c)

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

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

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

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

print(li)

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

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

for s, t in zip(S, T):
    print(s, end='')
    print(t, 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 = map(str, input().split())

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

print("".join(ret))

Solution (Python):
n = int(input())
a, b = input().split()
c = ''
for x, y in zip(a, b):
	c += x + y
print(c)

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

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

print(ans)

Solution (Python):
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
from fractions import gcd



def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['No', 'Yes']
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False



def main():
    N = I()
    S, T = map(str, input().split())

    for i in range(N*2):
        if i % 2 == 0:
            print(S[i//2], end='')
        else:
            print(T[i//2], end='')

    print()


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

n = int(sys.stdin.readline().rstrip())
s, t = sys.stdin.readline().split()

def main():
    res = [None] * n * 2
    res[::2] = list(s)
    res[1::2] = list(t)
    return ''.join(res)

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
n = int(input())
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 = 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()

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

print(u)

Solution (Python):
N = int(input())
S, T = map(str, 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 i in range(n):
    ans.append(s[i])
    ans.append(t[i])

print("".join(ans))

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

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

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

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

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

Solution (Python):
n = int(input())
s1, s2 = input().split()
ret = []
for i in range(n):
    ret.extend((s1[i], s2[i]))
print(''.join(ret))

Solution (Python):
n=int(input())
l=list(input().split())
s=l[0]
t=l[1]

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

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

ans = []
for a, b in zip(s, t):
    ans.append(a)
    ans.append(b)

print(''.join(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):



def solve(*args: str) -> str:
    n = int(args[0])
    s, t = args[1].split()
    ret = ''
    for i in range(n):
        ret += s[i]+t[i]
    return str(ret)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Solution (Python):
if __name__ == '__main__':
    n = int(input())
    s = input()
    list = s.split(" ", )
    ans=""
    for i in range(n):
        ans = ans + list[0][i]+list[1][i]
    print(ans)

Solution (Python):

def main():
    N = int(input())
    s,t = [x for x in input().split()]

    ans = ""

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

    print(ans)
if __name__ == "__main__":
    main()

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=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()
for a, b in zip(s, t):
    print(a + b, 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):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

_ = int(readline())
s, t = input().split()
r = ''
for i, j in zip(s, t):
  r += i + j
print(r)

Solution (Python):


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


if __name__ == "__main__":
    main()

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

S=a[0]
T=a[1]
answer=[]

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

print(''.join(answer))

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

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

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

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

print(s)

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

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

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 = list(input().split())
for i in range(n):
  print(s[i],end="")
  print(t[i],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 = 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()
a = "".join(i+j for i, j in zip(s, t))
print(a)

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

s=''

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

print(s)

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 x,y in zip(s,t):
    ans+=x+y
print(ans)

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

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

print(k)

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


lista=list(a)
listb=list(b)

ans = ""

for i in range(N):
  ans = ans + lista[i]
  ans = ans + listb[i]
  
print(ans)

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

Solution (Python):
N=int(input())
str_list = input().split(' ')
s, t = str_list[0], str_list[1]

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

Solution (Python):
n = int(input())
S,T = (i for i in input().split())

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

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

Solution (Python):
n=input()
li=list(map(str,input().split()))

s=''
for i in range(len(li[0])):
  s+=li[0][i]
  s+=li[1][i]
print(s)

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

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

print(''.join(o))

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

out=""
for i,j in zip(a,b):
    out+=i
    out+=j
print(out)

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

ans = "".join([s + t for s, t in zip(S, T)])
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=input().split()
print(''.join([T[i//2] if i%2 else S[i//2] for i in range(2*N)]))

Solution (Python):
import sys, math
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline



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

print(ans)

Solution (Python):
def two_int():
    N, K = map(int, input().split())
    return N,K

def one_int():
    return int(input())

def one_str():
    return input()

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

N=one_int()
temp = list(input().split())
S=temp[0]
T=temp[1]

output = []
for s,t in zip(S,T):
    output.append(s)
    output.append(t)    

print("".join(output))

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

Solution (Python):
N = int(input())
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=input().split()

ans=""

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

print(ans)

Solution (Python):
n = int(input())
li = list(input().split())
k = 0
while k < n:
  print(li[0][k], end = "")
  print(li[1][k], end = "")
  k += 1

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

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

Solution (Python):
n=int(input())
str1,str2=map(str,input().split())
for x in range(n):
	print(str1[x],end='')
	print(str2[x],end='')

Solution (Python):
words = lambda t : list(map(t, input().split()))
n = int(input())
s, t = words(str)
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 = 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 + t
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 = 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()
c=[]
for i in range(n):
    c.append(s[i])
    c.append(t[i])
print(''.join(c))

Solution (Python):
def examA():
    AB = [I() for _ in range(2)]
    for i in range(1,4):
        if not i in AB:
            ans = i
            break
    print(ans)
    return

def examB():
    N = I()
    S,T = LSI()
    ans = ""
    for i in range(N):
        ans += S[i]+T[i]
    print(ans)
    return

def examC():
    return

def examD():
    return

def examE():
    return

def examF():
    return

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

if __name__ == '__main__':
    examB()

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):
import sys
input = sys.stdin.readline
import numpy as np
N = int(input())
S, T = input().split()
new_S = []
for i in range(N):
    new_S.append(S[i])
    new_S.append(T[i])
print("".join(new_S))

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

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

print(''.join(l))

Solution (Python):
'''
author : w2sc
  date : 2019/12/22
  time : 20:03:13
'''
n=int(input())
a,b=input().split()
i=0
s=""
while i<n:
    s+=a[i]+b[i]
    i+=1
print(s)

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

for i, j in zip(S, T):
    print(i,end='')
    print(j,end='')
print()

Solution (Python):

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

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

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


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

print(ans)

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

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

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

Solution (Python):


def resolve():
    N = input()
    S, T = input().rstrip().split(" ")

    s = ""
    for a, b  in zip(S, T):
        s += a + b
    print(s)


if __name__ == "__main__":
    resolve()

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

ans = []

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

print("".join(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):



def ri():
    return int(input())

def rl():
    return list(input().split())

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

def main():
    n = ri()
    s, t = rl()
    a = [s[i]+t[i] for i in range(len(s))]
    print("".join(a))


if __name__ == '__main__':
    main()

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

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


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

print(ans)

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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(1000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

ans = ''
for i in range(2*n):
    if i % 2:
        ans += t[i//2]
    else:
        ans += s[i//2]
print(ans)

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

Solution (Python):
N=int(input())
S=input()
T=''

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

print(T)

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

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


            

if __name__ == '__main__':
    main()

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 math
import statistics
import numpy as np
import queue

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

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

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

print()

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

for a, b in list(zip(s, t)):
  i = a+b
  print(i, end="")

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 = ""
count_s = 0
count_t = 0
for i in range(n*2):
    if i%2 == 0:
        ans += s[count_s:count_s+1]
        count_s += 1
    else:
        ans += t[count_t:count_t+1]
        count_t += 1
print(ans)

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

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

print("".join(x))