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 __future__ import print_function

import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# import math
# import string
# import fractions
# from fractions import Fraction
# from fractions import gcd

# def lcm(n,m):
#     return int(n*m/gcd(n,m))

# import re
# import array
# import copy
# import functools
# import operator

# import collections
# import itertools
# import bisect
# import heapq


# from heapq import heappush
# from heapq import heappop
# from heapq import heappushpop
# from heapq import heapify
# from heapq import heapreplace

# from queue import PriorityQueue as pq

# def reduce(p, q):
#     common = fractions.gcd(p, q)
#     return (p//common , q//common )
# # from itertools import accumulate
# # from collections import deque

# from operator import mul
# from functools import reduce

# def combinations_count(n, r):
#     r = min(r, n - r)
#     numer = reduce(mul, range(n, n - r, -1), 1)
#     denom = reduce(mul, range(1, r + 1), 1)
#     return numer // denom

# import random

def main():
    n = int(input().strip())
    l1,l2 = map(list, input().strip().split())

    for i in range(n):
        print(l1[i],end="")
        print(l2[i],end="")
    print()
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

l = []

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


print(''.join(l))

Submission status: Accepted

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

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.append(s[i])
  u.append(t[i])
print("".join(u))

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

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

for j in ans:
    print(j, end='')

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

Solution code:
N = int(input())
S,T = input().split()
S = list(S)
T = list(T)
count = 0
for i in range(N):
    print(S[count],T[count],sep = "" ,end = "")
    count = count + 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=(x for x in input().split())
alist=[]

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

o="".join(alist)
print(o)

Submission status: Accepted

Solution code:
from fractions import gcd
# from datetime import date, timedelta
from heapq import*
import math
from collections import defaultdict, Counter, deque
from bisect import *
import itertools
import fractions
import sys
sys.setrecursionlimit(10 ** 7)
MOD = 10 ** 9 + 7
# input = sys.stdin.readline


def lcm(a, b):
    return a * b / fractions.gcd(a, b)

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

    
    

        


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
p = input().split()

s = p[0]
t = p[1]

a = []


c = 0
d = 0
for i in range(n):
    a.append(s[c])
    a.append(t[d])
    c+=1
    d+=1

print(*a, sep = '')

Submission status: Accepted

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


L = ""
for x,b in zip(S,T):
    L = L + x + b
print(L)

Submission status: Accepted

Solution code:
loop = int(input())
stra,strb = input().split()

a_list = list(stra)
b_list = list(strb)

ret = ''
for i in range(loop):
    ret += (a_list[i]+b_list[i])

print(ret)

Submission status: Accepted

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

newString = ''

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from collections import deque

n = int(input())
a, b = [deque(x) for x in input().split()]
s = ''
for _ in range(n):
  s += a.popleft()
  s += b.popleft()
print(s)

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])
  
X= ''.join(A)
print(X)

Submission status: Accepted

Solution code:
n = int(input())
a = input().split()
ans = ''
for  i,j in  zip(a[0],a[1]):
	ans += i + j
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=input().split()
str=""
#print(s,t)
#print(s[0],t[0])
for c in range(N):
  str+=s[c]
  str+=t[c]
print(str)

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:
def q2(n,s,t):
    newstr = ""
    for i in range(n):
        newstr += (s[i]+t[i])
    return newstr

n=int(input())
st=input().split()
print(q2(n,st[0],st[1]))

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:
num = int(input())
string = input().rstrip().split(" ")
a, b = string[0],string[1]
a, b = list(a),list(b)


for i in range(num):
    print(a[i], end="")
    print(b[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]

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

Submission status: Accepted

Solution code:
n = int(input())
S,T = input().split()
ans = ""
s = list(S)
t = list(T)
for (i,j) in zip(s,t):
    ans = ans + i + j
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:
# -*- coding: utf-8 -*-

from math import ceil,floor

# n=int(input())
# A,B,C,D=map(int, input().split())
# string = input()
# list = list(map(int, input().split()))

# def func(a):
#    return tmp

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

ans = S[0]+T[0]

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

print(ans)

Submission status: Accepted

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

print(answer)

Submission status: Accepted

Solution code:
n = int(input())
l, r = input().split()

s = ''
for i in range(len(r)):
  s += l[i]
  s += r[i]
  
print(s)

Submission status: Accepted

Solution code:
length = int(input())
a,b = [i[0:length] for i in input().split()]
s = ""
for i in range(length):
    s += a[i]
    s += b[i]
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=int(input())
t=str(input())
p=''
for i in range(s*2):
  if i%2==0:
    p=p+t[i//2]
  else:
    p=p+t[i//2+s+1]
print(p)

Submission status: Accepted

Solution code:
import sys
N = int(input())
S = []
T = []
ST = []

S, T = input().split()

for i in range(N):
    sys.stdout.write(S[i])
    sys.stdout.write(T[i])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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

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

Submission status: Accepted

Solution code:
a = int(input())
word = input().split()
ans = ""

for i in range(a):
    ans += word[0][i:i+1] + word[1][i:i+1]
print(ans)

Submission status: Accepted

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

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

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(list, 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()
out = ''
for c, d in zip(s, t):
  out += c + d
print(out)

Submission status: Accepted

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

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

print(tmp)

Submission status: Accepted

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

print("".join(ans))

Submission status: Accepted

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

print(outstr)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(out)

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())
Str = list(input().split())
S = Str[0]
T = Str[1]

answer = []
for i in range(N):
  answer.append(S[i])
  answer.append(T[i])
output = ''.join(answer)
print(output)

Submission status: Accepted

Solution code:
n=int(input())
st=input().split(" ")
ans=''
for i in range(n):
    ans+=st[0][i]+st[1][i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = [str(_) for _ in input().split()]

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
_ = input()
S, T = input().strip().split(" ")

res = []

for f,s in zip(S,T):
    res.append(f)
    res.append(s)

print("".join(res))

Submission status: Accepted

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

k = [z for sublist in [[x,y] for x,y in zip(s,t)] for z in sublist]
print("".join(k))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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


# 出力
print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

u=''

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

print(u)

Submission status: Accepted

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


def solve():
    answer = ''
    for i in range(N):
        answer += (S[i] + T[i])
    return print(answer)


solve()

Submission status: Accepted

Solution code:
from itertools import chain

input()
print(''.join(chain.from_iterable(zip(*input().split()))))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(*word, sep='')

Submission status: Accepted

Solution code:
n = int(input())
str = input().split()
s = str[0]
t = str[1]

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


print(new)

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

Submission status: Accepted

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

r=""

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

print(r)

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str,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))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input().split()
N=int(s[0])
s = input()
out=[]
for i in range(N):
    out.append(s[i])
    out.append(s[i+N+1])

out=''.join(out)
print(out)

Submission status: Accepted

Solution code:
N = int(input())
A = list(input().split())
S = list(A[0])
T = list(A[1])
X=[]
for i in range(N):
    X.append(S[i])
    X.append(T[i])
print(''.join(X))

Submission status: Accepted

Solution code:
a = int(input())
s = input().split()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# B - Strings with the Same Length
import sys
import os

def problem148B(N ,S, T):
	
	st = ""
	for i in range(N):
		st += S[i] + T[i]
		
	print(st)

if __name__ == "__main__":
	N = int(input())
	S, T = input().split()

	problem148B(N, S, T)

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

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

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

print(Answer)

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:
d = int(input())
l = input().split(' ')
left, right = l[0], l[1]

output = ''
for i in range(d):
  output += left[i] + right[i]
print(output)

Submission status: Accepted

Solution code:
k=int(input())
l=list(map(str, input().strip().split(' ')))
a=l[0]
b=l[1]
j=''
for i in range(k):
    j=j+a[i]+b[i]
print(j)

Submission status: Accepted

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

str = ''

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

print(str)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

n = int(input())
s, t = map(str, 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())
S,T = input().split()
C = []
for i in range(N):
    C += (S[i] + T[i])
for i in C:
    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()
result = ''
for i in range(n):
    result += s[i]
    result += t[i]

print(result)

Submission status: Accepted

Solution code:
N=int(input())
data=input().split()
s=""
for i in range(N):
    s+=data[0][i]
    s+=data[1][i]
print(s)

Submission status: Accepted

Solution code:
a=int(input())
s,t=[x for x in input().rstrip().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 = []
j = 0
k = 0
for i in range(2*N):
    if i%2 == 0:
        ans.append(S[j])
        j += 1
    else:
        ans.append(T[k])
        k += 1

print("".join(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())
l=list(input())

m=[]
for i in range(2*n):
    if i//2==i/2:
        m.append(l[i//2])

    else:
        m.append(l[n+(i+1)//2])

for i in m:
    print(i,end="")

Submission status: Accepted

Solution code:
n=int(input())
a,b=map(str,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=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().strip().split()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = [int(e) for e in lines[0].split(" ")][0]
    (s, t) = [e for e in lines[1].split(" ")]

    return (n, s, t)


def solve(n, s, t):


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

    return "".join(result)


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Accepted

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


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

    ans = []
    for s, t in zip(S, T):
        ans.append(s)
        ans.append(t)
    print(''.join(ans))


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
S2=list(S)
T2=list(T)
P=[]
for s, t in zip(S2,T2):
    p=s+t
    P.append(p)
print(''.join(P))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

N = int(input())
str1, str2 = input().split()
output_str = ""
for i in range(N):
  output_str += str1[i]
  output_str += str2[i]
print(output_str)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t = ''
for i,j in zip(b,c):
    t += i+j
print(t)

Submission status: Accepted

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

concat_text = ""
for x, y in zip(S, T):
    concat_text += x
    concat_text += y

print(concat_text)

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

Submission status: Accepted

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

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

print(''.join(l))

Submission status: Accepted

Solution code:
n=int(input())
a,b = map(str,input().split())
f = ""
for i in range(n):
  f += a[i]
  f += b[i]
print(f)

Submission status: Accepted

Solution code:
n = int(input())
s, t = (input().split(' '))
#print(s,t)
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())
s, t = map(format, input().split())

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

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
a,b=map(str, input().split())
moji = []
m = ''
for i in range(len(a)):
  m += a[i]
  m += b[i]

print(m)

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    outs=True
    for i in range(N):
        print(S[i], end="")
        print(T[i], end="")
    print()
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(N, S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
b=input().split()
c=[]
for i in range(a):
    c.append(b[0][i])
    c.append(b[1][i])
e=''.join(c)
print(e)

Submission status: Accepted

Solution code:
N = int(input())
A,B = map(list,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=input().split()
for i in range(n):
    print(s[0][i],end='')
    print(s[1][i],end='')

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ""
for a, b in zip(S[0], S[1]):
  ans += (a + b)

print(ans)

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

# print(n, s, t)

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.append(s[i])
    u.append(t[i])
print("".join(u))

Submission status: Accepted

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

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

print(*c, sep='')

Submission status: Accepted

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

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

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()
s=list(s)
t=list(t)
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 s, t in zip(S, T):
    ans.append(s + t)

print("".join(ans))

Submission status: Accepted

Solution code:
from functools import reduce
from operator import add
N = int(input())
S,T = input().split()
print(reduce(add, [s+t for s,t in zip(S,T)]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

S, T = input().split()

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

print()

Submission status: Accepted

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

Submission status: Accepted

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

st = ''

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


print(st)

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, sep='')

Submission status: Accepted

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

L = []

for n in range(N):
  L.append(S[n])
  L.append(T[n])
  
print(''.join(L))

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.append(S[i])
    ans.append(T[i])

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
# input = sys.stdin.readline
# from bisect import *
# from collections import *
# from heapq import *
# import functools
# import itertools
# import math
INF = 500000
MOD = 10**9+7

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

    for s, t in zip(S, T):
        print("{}{}".format(s, t), end="")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

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)