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



Sample input:
2
ip cc


Sample output:
icpc

Submission status: Accepted

Solution code:
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
#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 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
# show_flg = True


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

ans = ''

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

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

print("".join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(''.join(A))

Submission status: Accepted

Solution code:
N = int(input())
s, t = input().split()

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
N=int(input())
S,T=map(list,input().split())
#print(S,T)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

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

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

print (ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

s=''

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

print(s)

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
ans=''
for x,y in zip(s,t):
    ans+=x+y
print(ans)

Submission status: Accepted

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

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

print(k)

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(o))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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)]))

Submission status: Accepted

Solution code:
import sys, math
from collections import defaultdict
from copy import deepcopy
import itertools
input = sys.stdin.readline
# 文字列の場合は普通のinput()を使うか下を使う
# input = sys.stdin.readline().rstrip()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(Ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans=""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
n = int(input())
s, t = input().split()

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!python3

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

Submission status: Accepted

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

ans = []

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

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

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

Submission status: Accepted

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

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(T)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/
#
# lang: Python3 (3.4.3)

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

Submission status: Accepted

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

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

print()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
w = list(map(str, input().split()))

ans = ''
for i in range(N):
	ans+=w[0][i]
	ans+=w[1][i]

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
s,d=input().split()
print("".join([a+b for a,b in zip(s,d)]))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
from copy import deepcopy
from sys import exit,setrecursionlimit
import math
from collections import defaultdict,Counter,deque
from fractions import Fraction as frac
import fractions
from functools import reduce
from operator import mul
import bisect
import sys
import logging
import heapq
import itertools

logging.basicConfig(level=logging.ERROR)

input = sys.stdin.readline

setrecursionlimit(1000000)


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

def factorization(n):
	if n<2:
		return []
	arr = []
	temp = n
	for i in range(2, int(-(-n**0.5//1))+1):
		if temp%i==0:
			cnt=0
			while temp%i==0:
				cnt+=1
				temp //= i
			arr.append([i, cnt])

	if temp!=1:
		arr.append([temp, 1])

	if arr==[]:
		arr.append([n, 1])

	return arr

def cmb(n,r):
    r = min(n-r,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n - r, -1))
    under = reduce(mul, range(1,r + 1))
    return over // under

def zip(a):
	mae = a[0]
	ziparray = [mae]
	for i in range(1,len(a)):
		if(mae != a[i]):
			ziparray.append(a[i])
			mae = a[i]
	return ziparray

def is_prime(n):
	if n < 2: return False

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

	return True

def list_replace(n,f,t):
	return [t if i==f else i for i in n]

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

def gcd(numbers):
	return reduce(fractions.gcd, numbers)

def lcm(numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

class Queue():
	def __init__(self):
		self.q = deque([])
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.popleft()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class Stack():
	def __init__(self):
		self.q = []
	def push(self,i):
		self.q.append(i)
	def pop(self):
		return self.q.pop()
	def size(self):
		return len(self.q)
	def debug(self):
		return self.q

class graph():
	def __init__(self):
		self.graph = defaultdict(list)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
		self.graph[t].append(f)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
		self.graph[t].remove(f)
	def linked(self,f):
		return self.graph[f]

class dgraph():
	def __init__(self):
		self.graph = defaultdict(set)
	def addnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].append(t)
	def rmnode(self,l):
		f,t = l[0],l[1]
		self.graph[f].remove(t)
	def linked(self,f):
		return self.graph[f]

class PriorityQueue():
	def __init__(self):
		self.queue = []
	def push(self,i):
		heapq.heappush(self.queue,-i)
	def pop(self):
		return -1 * heapq.heappop(self.queue)
	def sum(self):
		return -sum(self.queue)

main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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


print(ans)

Submission status: Accepted

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

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

print()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N=int(input())
a=list(input().split())
#print(a)

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

N = int(input())

ans = ""
S, T = (i for i in input().split())  
#a = [int(i) for i in input().split()] 
#e = [[int(i) for i in input().split()] for i in range(n)] 

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(''.join([i+j for i, j in zip(S, T)]))

Submission status: Accepted

Solution code:
N = int(raw_input())
S, T = map(str, raw_input().split())

ans = ""

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

print ans

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
n=int(input())
s,t=input().split()
tmp=""
for i in range(n):
    tmp+=s[i]
    tmp+=t[i]
print(tmp)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
sss, ttt = input().split()

output = ''
for s, t in zip(sss, ttt):
  output += s + t
  
print(output)

Submission status: Accepted

Solution code:
import sys
import math
import re
import io

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
ans = ''
for i, z in zip(s, t):
    ans += i + z
print(ans)

Submission status: Accepted

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

res = ""

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

print(res)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#x = list(map(int, input().split()))
N = int(input())
S, T = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())

S, T = input().split()

out = ''

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

print(out)

Submission status: Accepted

Solution code:
n = int(input())
k = input().split()
for i in range(0,n):
    print(k[0][i],end="")
    print(k[1][i],end="")

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
A = []

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

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

Submission status: Accepted

Solution code:
#JMD
#Nagendra Jha-4096

 
import sys
import math

#import fractions
#import numpy
 
###File Operations###
fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile

###Defines...###
mod=1000000007
 
###FUF's...###
def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 
##### Main ####
t=1
for tt in range(t):
    n=int(input())
    x,y= map(str, sys.stdin.readline().split(' '))
    ans=""
    for i in range(n):
        ans+=x[i]
        ans+=y[i]
    print(ans)
    #a=list(map(int,sys.stdin.readline().split(' ')))
    
    
#####File Operations#####
if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Submission status: Accepted

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

ans = ''
for Si, Ti in zip(S, T):
    ans += Si
    ans += Ti

print(ans)

Submission status: Accepted

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

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

print(r)