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

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

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

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

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

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

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

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

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

Solution (Python):
import sys


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


main()

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.append(S[i])
    ans.append(T[i])
print(*ans,sep='')

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

Solution (Python):
from sys import stdin 
n = int(stdin.readline().rstrip())
s,t = [x for x in stdin.readline().rstrip().split()]
a = []
for i in range(n):
    a.append(s[i])
    a.append(t[i])
a = ''.join(a)
print(a)

Solution (Python):
from sys import stdin


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


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


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


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

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

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

print(answer)

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

input=lambda: sys.stdin.readline().rstrip()

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

show_flg=False
show_flg=True


ans=0

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

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


print(''.join(ans))

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

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

Solution (Python):
import sys

str = sys.stdin.readlines()

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

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

print(string)

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

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

print(result)

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

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

st = ''

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

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

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

X = str('')

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

print(X)

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

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

import sys


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
test = ""

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

n = int(input2())
a, b = input2().strip().split()

ans = ""
for i in range(n):
    ans += a[i]
    ans += b[i]

print(ans)

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

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

char_lists = []

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

print("".join(char_lists))

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

result = ''

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

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

Solution (Python):
def main():
    N = int(input())
    S, T = map(str, input().split())
    A = []

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

    print("".join(A))


if __name__ == "__main__":
    main()

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

print(kotoba)

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

print(''.join(o))

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

s = []

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

print("".join(s))

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

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

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

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

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

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

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

    print(ans)


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

    main(n, s, t)

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 = [ v for v in 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 = str()
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=x+s[i]+t[i]
print(x)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
f_i = stdin

N = int(f_i.readline())

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

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

Solution (Python):
n = int(input())
b = input().split()
s = b[0]
t = b[1]
p = []
for q in range(n):
 p.append(s[q])
 p.append(t[q])

r = ""
for x in p:
    r += x
print(r)

Solution (Python):


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

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

print('')

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

ans = ""

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

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

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

Solution (Python):
N = int(input())
S, T = map(str, input().split())
cnt = 0
ans = ''
while cnt < N:
  ans += S[cnt] + T[cnt]
  cnt += 1

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


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

print(''.join(str))

Solution (Python):
import sys

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

sys.setrecursionlimit(10 ** 9)


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

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

    print(ans)


if __name__ == '__main__':
    main()

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

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



N=int(input())

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

res=""

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

print(res)

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

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

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

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

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

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

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

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

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


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

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

        text = text + ss
        text = text + tt

    print(text)


class Scan():

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

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

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


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


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


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


main()

Solution (Python):
import itertools
from collections import deque,defaultdict,Counter
from itertools import accumulate
import bisect
from heapq import heappop,heappush
from fractions import gcd
from copy import deepcopy
import math
import queue


Mod = 1000000007
import sys

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

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




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



if __name__ == "__main__":
    main()

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

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

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

ret = ""

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

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

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

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()
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):
INF = float("inf") 
MOD = 10**9+7 
MAX = 510000 

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


if __name__ == "__main__":
    main()

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

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

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

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

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

Solution (Python):
n = int(input())
s, t = input().split()
print(''.join(c + d for c, d in zip(s, t)))

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

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

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

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

Solution (Python):
import numpy as np

N = int(input())

data = input().split()

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

Solution (Python):
import numpy as np

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

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

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

	print(ans)

	




if __name__ == '__main__':
	main()

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

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

Solution (Python):
from sys import stdin


if __name__ == '__main__':
    N = int(stdin.readline().rstrip())
    S, T = stdin.readline().rstrip().split()
    
    result = ''
    for i in range(N):
        result += S[i]
        result += T[i]
    print(result)

Solution (Python):
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):
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
input = sys.stdin.readline

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

s0,t0 = map(str,input().split())
s = list(s0)
t = list(t0)
ans = []

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline






















def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	A = inputInt()
	T = input()

	ST = T.split()

	ans = ""
	for i in range(A):
		ans += ST[0][i]
		ans += ST[1][i]

	print(ans)



if __name__ == "__main__":
	main()

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

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

print(ans)

Solution (Python):

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

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

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

ans = []
for i in range(2*N):
    if i % 2 == 0:
        ans.append(S[i//2])
    else:
        ans.append(T[i//2])

print("".join(ans))

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

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

print(a)

Solution (Python):
n=int(input())
s_t_list = input().split()

s = ''
for i in range(n):
    s += s_t_list[0][i]
    s += s_t_list[1][i]

print(s)

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

result = ""

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

print(result)

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

g = ""
for i in range(N):
    g = g + moji[0][i] + moji[1][i]

print(g)

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

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


n=int(input())


s,j=(x for x in input().split())

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

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

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

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

print(r)

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

Solution (Python):
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    S, T = input().split()

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


main()

Solution (Python):

import sys
import math
import collections


n=int(input())

tmp = input().split()
t1 = tmp[0]
t2 = tmp[1]
t3=""

for i in range(n):
	t3=t3+t1[i]
	t3=t3+t2[i]
print(t3)

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

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

StrList = input().split(" ")

string = ""
for i in range(Leng):
  string += StrList[0][i]
  string += StrList[1][i]
print(string)

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

Solution (Python):

import sys
from fractions import gcd
from string import ascii_uppercase as ABC

def inpl(): return list(map(int, input().split()))
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())
c1,c2 = input().split(" ")
c1 = list(c1)
c2 = list(c2)
c = []
for i in range(n):
  c.append(c1[i])
  c.append(c2[i])

print("".join(c))

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

    ans = []
    for i, j in zip(s, t):
        ans.append(i)
        ans.append(j)
    
    print("".join(ans))

if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())-1
li = input().split()
s=li[0]
t=li[1]
sli=list(s)
tli=list(t)
i=0
stat=''
while i<=n:
    stat+=sli[i]+tli[i]
    i+=1


print(stat)

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())
a,b=input().split()
l=[]
for i in range(n):
  l.append(a[i])
  l.append(b[i])
for i in l:
  print(i,end="")

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

Solution (Python):
n = int(input())
moji = input()
S = moji.split(" ")[0]
T = moji.split(" ")[1]

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

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

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

Solution (Python):
l = input()
a, b = list(input().split())
x = ''
for i, j in zip(a,b):
    x = x + str(i) + str(j)
print(x)

Solution (Python):
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True 
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

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

print(str)

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

for ss, tt in zip(S, T):
    print('{}{}'.format(ss, tt), end='')
print()

Solution (Python):
n = int(input())
s1,s2 = map(str,input().split())

s = ""


for i in range(n):
    s += s1[i]+s2[i]
print(s)

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

Solution (Python):



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

print(answer)

Solution (Python):
N = int(input())
s_string, t_string = input().split(' ')

output = ''

for i in range(len(s_string)):
    output += s_string[i] + t_string[i]

print(output)

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

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

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

print(st)

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

print(s)

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

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

print(L)

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

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

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

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())
st=list(map(str,input().split()))
s=list(st[0])
t=list(st[1])
com = []
for i in range(len(s)):
    com.append(s[i])
    com.append(t[i])
print("".join(com))