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:
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()
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],sep="",end="")

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:
# coding: utf-8
# Your code here!
N=int(input())
S,T=input().split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
i = input().split()
S = list(i[0])
T = list(i[1])

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

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

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

Submission status: Accepted

Solution code:
num = input()
moji_list = input().split()
new_moji = ""
for i in range(int(num)):
	new_moji += moji_list[0][i]+moji_list[1][i]
print(new_moji)

Submission status: Accepted

Solution code:
N = int(input())
A,B = list(map(str,input().split()))
ans=A[0]+B[0]
for i in range(N-1):
  ans = ans+A[i+1]+B[i+1]
print(ans)

Submission status: Accepted

Solution code:
N = int(input())
S, T = [str(s) for s in 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())
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()
for i in range(n):
    print(s[i],end = "")
    print(t[i],end = "")

print()

Submission status: Accepted

Solution code:
N, S, T = open(0).read().split()
N = int(N)

#print(N, S, T)

new_word = ""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc148/tasks/abc148_b

n = int(input())
s, t = input().split()
print("".join([s1 + t1 for s1, t1 in zip(s, t)]))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
ans=''
_temp=''
for i in range(n):
  _temp=s[i]+t[i]
  ans+=_temp
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:
l=int(input())
S,T=input().split()
out=""
for k in range(0,l):
    out=out+S[k]+T[k]
print(out)

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    n = stdin.readline()
    l = stdin.readline()
    s = l.split(' ')[0]
    t = l.split(' ')[1]
    ans = ''
    sw = 0
    for i in range(len(s)):
        ans += s[i]
        ans += t[i]
    print(ans)

Submission status: Accepted

Solution code:
import math

class Input():
	def readInt(self):
		return int(input())

	def readIntArray(self):
		return [int(x) for x in input().split(" ")]

	def readString(self):
		return input()

	def readStringArray(self):
		return input().split(" ")

	def readFloat(self):
		return float(input())

	def readFloatArray(self):
		return [float(x) for x in input().split(" ")]

def main():
	inp = Input()
	_ = inp.readInt()
	s1, s2 = inp.readStringArray()

	output = ""
	for c1, c2 in zip(s1, s2):
		output += (c1 + c2)

	print(output)


if __name__ == "__main__":
   main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s1, s2 = list(map(str, input().split()))
for i in range(n):
    print(s1[i] + s2[i], end="")
print()

Submission status: Accepted

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


def main():
    N = int(input())
    S, T = map(list, input().split())
    result = ''
    for s, t in zip(S, T):
        result += s + t
    print(result)


if __name__ == "__main__":
    main()

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:
import sys
stdin = sys.stdin
import numpy as np

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))

a = ni()
s, t = ns().split()
for i, j in zip(s, t):
    print(i, end="")
    print(j, end="")
print()

Submission status: Accepted

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

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

Submission status: Accepted

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

output = ""
for count in range(N):
    output = output + S[count] + T[count]
print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp_1 = int(input())
inp_2 = input().split(" ")
r = ""

for i in range(inp_1):
  r += inp_2[0][i]
  r += inp_2[1][i]

print(r)

Submission status: Accepted

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

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

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

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


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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = list(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(list,input().split())
l=[]
for i in range (0,N):
    l.append(S[i])
    l.append(T[i])
print("".join(l))

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

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

Submission status: Accepted

Solution code:
N = input()
S = input()
l = S.split() # list
ans = ""

for i in range(int(N)):
    ans = ans + l[0][i] + l[1][i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
	n=int(input())
	s,t = list(map(str,input().split()))
	new=s[0]
	for i in range(0,n):
		if i == 0:
			new =str(s[i]+t[i])
		else:
			new = str(new+s[i]+t[i])
	print(new)
main()

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

Submission status: Accepted

Solution code:
num=int(input())
strs=input().split()
text=""
for i in range(num):
  text+=strs[0][i]
  text+=strs[1][i]
print(text)

Submission status: Accepted

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

word = ''

for i in range(n):
  si = s[i]
  ti = t[i]
  word += si + ti
print(word)

Submission status: Accepted

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

for x,y in zip(s,t):
    print("{0}{1}".format(x,y),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())
x, y = input().split()
i=0;
j=0;
while i<len(x) and j<len(y):
    print(x[i], end="")
    i+=1
    print(y[j], end="")
    j+=1

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
s=list(S)
t=list(T)
n=[]

for i,j in zip(s,t):
    a=i+j
    n.append(a)
b="".join(n)
print(b)

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

Submission status: Accepted

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

st=""

length=len(S)

for i in range(length):
    st=st+S[i]+T[i]

print(st)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
N = int(input())
S, T = input().split(" ")
for i in range(len(S)):
    print(S[i], end="")
    print(T[i], end="")

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
print("".join([c1+c2 for c1, c2 in zip(s, t)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    n=int(input())
    s,t=input().split()
    print(''.join(x+y for x,y in zip(s,t)))

main()

Submission status: Accepted

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

for ss,tt in zip(s,t):
    print(ss + tt, end="")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

ss, tt=list(s), list(t)

o = str()
for i in range(len(ss)):
    o += ss[i] + tt[i]
    
print(o)

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

STlen = len(S)

ans = ''

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

print(ans)

Submission status: Accepted

Solution code:
import sys
n=int(sys.stdin.readline())
a,b=map(str,sys.stdin.readline().split())
ans= "".join(i+j for i,j in zip(a,b))
print(ans)

Submission status: Accepted

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

STR = ""
for i in range(N):
    STR = "".join([STR, S[i]])
    STR = "".join([STR, T[i]])

print(STR)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

	input()
	A,B = input().split()

	ret = ""
	for x,y in zip(A,B):
		ret += ( x + y )

	print(ret)

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(0,N):
    chara = (S + T)[i::N]
    ans += chara

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A,B = input().split()
for i in range(N):
    print(A[i]+B[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()
a = s[0]
for i in range(len(s)):
    a = a + s[i] + t[i]
    
print(a[1:])

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(list, input().split())
ST = zip(S,T)
answer = []
for s,t in ST:
    answer.append(s)
    answer.append(t)
print(''.join(answer))

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

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

Submission status: Accepted

Solution code:
n=int(input())
a,b=[i for i in input().split()]
c=a[0]+b[0]
for i in range(n-1):
	c=c+a[i+1]+b[i+1]
print(c)

Submission status: Accepted

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


st_mixer = ''

for i in range(str_len):    
    
    st_mixer += s[i]  
    st_mixer += t[i]

print(st_mixer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
t=input().split()
a=list(t[0])
b=list(t[1])

s=""
for x in range(n):
    s+=a[x]+b[x]
print(s)

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

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

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())
cnt = 0
s,t = input().split()
ans = ''
while cnt != n:
  ans += s[cnt]
  ans += t[cnt]
  cnt += 1
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N = int(input())
S,T = map(str, input().split())

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

Submission status: Accepted

Solution code:
N = int(input())
S, T = 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()
U = ''
for i, j in zip(S, T):
  U += i + j
print(U)

Submission status: Accepted

Solution code:
n = input()
s, t = input().split()
for  s1, t1 in zip(s, t):
	print(s1, t1,sep="",end="")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A=input()
A=int(A)

S,T=input().split()

S_list=list(S)
T_list=list(T)

W=[]
for i in range(A):
	W.append(S_list[i])
	W.append(T_list[i])

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

Submission status: Accepted

Solution code:
n = int(input())
li = list(input())
ans = ""
for i in range(n):
    ans += li[i] + li[i+n+1]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(''.join([s[i::n] for i in range(n)]))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
row = sys.stdin.readline
def read_int(row):
    return int(row().rstrip())
def read_strings(row):
    return list(map(str, row().split()))
N = read_int(row)
S,T= read_strings(row)
 
for i in range(N):
    print(S[i],T[i], sep = "", end="")

Submission status: Accepted

Solution code:
import sys
row = sys.stdin.readline
def read_int(row):
    return int(row().rstrip())

def read_strings(row):
    return list(map(str, row().split()))

N = read_int(row)
S,T= read_strings(row)

st = ""
for i in range(N *2):
    if i%2 == 0:
        st +=S[i//2]
    else:
        st +=T[i//2]
print(st)

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

ss = [list(i) for i in s]
ans = ""
for i in range(n):
    ans = "".join([ans, ss[0][i]])
    ans = "".join([ans, ss[1][i]])

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

for i, j in zip(s,t):
	ans += i
	ans += 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:
n = int(input())
s, t = input().split()
str = ''

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

print(str)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
input()
print("".join(map("".join, zip(*input().split()))))

Submission status: Accepted

Solution code:
N = int(input())
x = input().split()
S, T = [list(i) for i in x]
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()
newList = [None] * 2 * N

for i in range(N):
    newList[2*i] = S[i]
    newList[2*i+1] = T[i]
newStr = ''.join(newList)
print(newStr)

Submission status: Accepted

Solution code:
int(input())
a,b=map(str,input().split())
for x,y in zip(a,b):
  print(x+y,end="",sep="")

Submission status: Accepted

Solution code:
n=int(input())
a,b=map(str,input().split())
c=str("")
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()
s = ""
for i in range(N):
  s += S[i] + T[i]
print(s)

Submission status: Accepted

Solution code:
# B - Strings with the Same Length

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

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

print(ans)

Submission status: Accepted

Solution code:
N = int(input())
ST = input()
S = ST[:N]
T = ST[N+1:]

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

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

print(str)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input()
s1, s2 = input().split()
for idx in range(len(s2)):
  print(s1[idx],end='')
  print(s2[idx],end='')
  
print()

Submission status: Accepted

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

print("".join(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

    for si, ti in zip(s, t):
        print(si, end="")
        print(ti, end="")

if __name__ == "__main__":
    main()

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())
S,T = input().split()
C=S[0]+T[0]

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

print(C)

Submission status: Accepted

Solution code:
n=int(input())

x,y = map(list,input().split())

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

Submission status: Accepted

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

ali=list(a)
bli=list(b)

x=''

for i in range(int(n)):
    x+=ali[i]+bli[i]
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
N=int(input())
S,T=(map(str,input().split()))
G=[]
for _ in range(N):
    G.append(S[_])
    G.append(T[_])
print("".join(G))

Submission status: Accepted

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

a_v1 = list(a)
b_v1 = list(b)

ans = []

for i in range(n):
    ans.append(a_v1[i])
    ans.append(b_v1[i])

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

Submission status: Accepted

Solution code:
n = int(input())

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

res=""

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : stdin.readline().split()
sys.setrecursionlimit(10 ** 7)

def main():
    n = ni()
    s, t = na()

    tmp = ""
    for i, ss in enumerate(s):
        tmp += ss + t[i]
    print(tmp)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(st)