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

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

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


if __name__ == '__main__':
    solve()

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

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

print(ans)

Solution (Python):
N = int(input())
s,t = [i for i in 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())
s=list(s)
t=list(t)
l=[]
for i,j in zip(s,t):
  l.append(i+j)
  
print(''.join(l))

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


if __name__ == '__main__':
    main()

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

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

import sys
input = sys.stdin.readline

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

Solution (Python):
import sys
n = int(input())
s, t = [i for i in sys.stdin.readline().split()]
res = ""
for _s, _t in zip(s, t):
    res += _s + _t
print(res)

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

print("".join(c for st in zip(S, T) for c in st))

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

s = list(s)
t = list(t)
ans = []

for ss,tt in zip(s, t):
    ans.append(ss)
    ans.append(tt)

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

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


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

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

print("")

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

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

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

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

Solution (Python):


from collections import defaultdict


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


def main():
	N = int(input())
	S, T = list(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 i in range(N):
    ans += S[i]
    ans += T[i]
    
print(ans)

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

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

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

Solution (Python):
import copy
import heapq
import math

def j(n):
    if n:print("Yes")
    else:print("No")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

n = ip()
a =input().split()
f = []
for i in range(n):
    f.append(a[0][i])
    f.append(a[1][i])
print(''.join(f))

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):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    S,T=input().split()
    ans=[None]*(2*n)

    for i in range(n):
        ans[2*i]=S[i]
        ans[2*i+1]=T[i]

    print(''.join(ans))
resolve()

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
    ans = []
    for i in range(n * 2):
        if i % 2 == 0:
            ans.append(s[i//2])
        else:
            ans.append(t[i//2])
    print("".join(ans))


if __name__ == '__main__':
    solve()

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

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

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

    print(new)

main()

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

Solution (Python):
import sys
input = sys.stdin.readline
N = int(input())
S, T = [x for x in input().strip().split()]
ans = ''
for s, t in zip(S, T):
    ans += s + t
print(ans)

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

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

print(ans)

Solution (Python):

from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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

    for i, j in zip(s, t):
        print(i, j, sep='', end='')
    print()




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\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):
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())
A,B=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 += 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):
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
    ans += j

print(ans)

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

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

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

Solution (Python):
N=int(input())
st=input().split(" ")
out=""
for i in range(N):
  out+=st[0][i]+st[1][i]
print(out)

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

anss = ''
for S, T in zip(Ss, Ts):
    anss += S+T

print(anss)

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


main()

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

input = sys.stdin.readline

ri = lambda: int(input())
rs = lambda: input().rstrip()
ril = lambda: list(map(int, input().split()))
rsl = lambda: input().rstrip().split()
ris = lambda n: [ri() for _ in range(n)]
rss = lambda n: [rs() for _ in range(n)]
rils = lambda n: [ril() for _ in range(n)]
rsls = lambda n: [rsl() for _ in range(n)]

n = ri()
s, t = rsl()
res = ''
for c0, c1 in zip(s, t):
    res += c0 + c1
print(res)

Solution (Python):
import sys
sys.setrecursionlimit(1000000000)
from itertools import count
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok


def main():
    N = ii()
    S, T = input().split()
    for s, t in zip(S, T):
        print(s, t, sep='', end='')


main()

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

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]





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
sys.setrecursionlimit(10**6)
if sys.platform in (['ios','darwin','win32']):
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(input())
def MAP(): return [int(s) for s in input().split()]

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

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

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

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

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

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

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

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

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

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

ret = ''
for s_, t_ in zip(S, T):
    ret += s_ + t_
print(ret)

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

print(ans)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce


sys.setrecursionlimit(2147483647)
INF = 1 << 100
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007


n = I()
a, b = LS()
ans = ''
for i in range(n):
    ans += a[i]
    ans += b[i]

print(ans)

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

Solution (Python):

import sys
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):
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)
input = sys.stdin.readline
INF = 2**62-1

def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(S, T):
    ans = []
    for a, b in zip(S, T):
        ans.append(a)
        ans.append(b)

    return ''.join(ans)


def main():
    N = read_int()
    S, T = read_str_n()
    print(slv(S, T))


if __name__ == '__main__':
    main()

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

ans = ""
for se, te in zip(s, t):
    ans += se + te

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

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

Solution (Python):
import sys
import math
MAX_INT = int(10e15)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
s, t = SL()

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

print ()

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


main()

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

answer=""

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

print(answer)

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

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

Solution (Python):
n=int(input())
a,b=input().split()
for i in range(n):
  print(a[i]+b[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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

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

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  n=I()
  s,t=LS()

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

  return ans


print(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):
from collections import Counter,defaultdict,deque
import sys
import bisect
import math
import itertools
import string
import queue
import copy
from itertools import permutations, combinations
from heapq import heappop, heappush

sys.setrecursionlimit(10**8)
mod = 10**9+7
 
def inp(): 
    return int(input())
def inpm(): 
    return map(int,input().split())
def inpl(): 
    return list(map(int, input().split()))
def inpls(): 
    return list(input().split())
def inplm(n): 
    return list(int(input()) for _ in range(n))
def inpll(n): 
    return [list(map(int, input().split())) for _ in range(n)]


def main():
    n=inp()
    st = inpls()
    s = st[0]
    t = st[1]
    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())
ans = ''

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

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

Solution (Python):


from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

N = input()
S, T = raw_input().split()
S2 = ""
for i in range(N):
    S2 += S[i]
    S2 += T[i]
print S2

Solution (Python):

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

ans = ""

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

print (ans)

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

ans = ""

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

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys


def main():
    
    N = list(input())
    S, T = input().split()

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

    print(new_string)


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

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

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

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

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

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

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

Solution (Python):

import sys
INF = float("inf")


def solve(N: int, S: str, T: str):
    ans = []
    for s, t in zip(S, T):
        ans.extend([s, t])
    print("".join(ans))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    S = next(tokens)  
    T = next(tokens)  
    solve(N, S, T)


if __name__ == '__main__':
    main()

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

Solution (Python):

import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
minans = inf ;ans = 0 ;count = 0 ;pro = 1

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

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    n = I()
    s,t = input().split()
    for i in range(2*n):
        if not i%2:
            print(s[i//2],end ="")
        else:
            print(t[i//2],end = "")
    print()
    return


if __name__ == "__main__":
    solve()

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











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    N=I()
    S,T=ST().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()
print("".join([s[i]+t[i] for i in range(n)]))

Solution (Python):


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

for s, t in zip(S, T):
    print(s, t, sep='', 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 = 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.append(S[i])
    ans.append(T[i])

print(''.join(ans))

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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

print(ans)

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

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

def main():
    input()
    s,t=input().split()
    ans=""
    for c0,c1 in zip(s,t):
        ans+=c0
        ans+=c1
    print(ans)
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()

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

Solution (Python):
n = int(input())
def f(x):
    return x
s,t = map(f,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())
S, T = input().split()
ans = ""
for s, t in zip(S, T):
  ans += s+t
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)