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

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

print(ans)

Submission status: Accepted

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

S = (list(Input[0]))
T = (list(Input[1]))

new = "a"

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

print(new[1:2*N+1])

Submission status: Accepted

Solution code:
#B
N=int(input())
S=input().split()
answer=""

for i in range(N):
    for j in range(2):
        answer+=S[j][i]
        #print(S[j][i])
        #print(answer)
        #print("//")

print(answer)

Submission status: Accepted

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

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

print(letters)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

__doc__ = """ {f}
""".format(f=__file__)

import re
import sys

n = input()
(s, t) = input().split(" ")[:2]
print("".join(["".join(e) for e in zip(s, t)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

S1=list(A)
S2=list(B)
C = [A] * (N*2)

for i in range(N*2):
	if (i+1)%2!=0:
		C[i] = A[i//2]
	else:
		C[i] = B[(i-1)//2]

print(''.join(C))

Submission status: Accepted

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

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 = list(s)
b = list(t)
c = []
for i in range(n):
    c.append(a[i])
    c.append(b[i])
print(''.join(c))

Submission status: Accepted

Solution code:
num = int(input())
line = input().split(" ")
s = line[0]
t = line[1]
for i in range(num):
  print(s[i] + t[i],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()
text = ''

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

print(text)

Submission status: Accepted

Solution code:
ans = ""

n = int(input())

s, t = input().split()

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

print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
s,t = stdin.readline().rstrip().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


print(''.join(word))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
str_len = int(input())
two_str = input().split()
str1 = two_str[0]
str2 = two_str[1]
ret_str = ""
for i in range(str_len):
    ret_str += str1[i]
    ret_str += str2[i]
print(ret_str)

Submission status: Accepted

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

Submission status: Accepted

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

answer = []
for i,j in zip(S, T):
    answer.append(i)
    answer.append(j)
answer = ''.join(answer)
print(answer)

Submission status: Accepted

Solution code:
n=int(input())
li=input().split()
a=list(li[0])
b=list(li[1])
c=''
for k in range(n):
    c=c+a[k]+b[k]

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
[str1,str2] = input().split()

result = []
for i in range(n):
    result.append(str1[i])
    result.append(str2[i])

print("".join(result))

Submission status: Accepted

Solution code:
n = int(input())
x,y = map(str,input().split())
xlist=list(x)
ylist=list(y)
ans = []
for k in range(n):
  ans.append(xlist[k])
  ans.append(ylist[k])
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    N = int(input())

    S, T = map(str, input().split())
    
    for i in range(N):
        print("{0}{1}".format(S[i], T[i]), end="")

main()

Submission status: Accepted

Solution code:
N = int(input())
li = input()
linew = li.split(' ')
S = linew[0]
T = linew[1]
SS = list(S)
TT = list(T)

ans = ''
for i in range(len(SS)):
    ans += SS[i]+TT[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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


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

  print(ans)

def main():
  solve()


if __name__ == "__main__":
  main()

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

Submission status: Accepted

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

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

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

    print(out)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = int(input())
s,t = [str(x) for x in input().split(' ')]
s,t = list(s),list(t)
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:
n = int(input())
s,t = map(str,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 = list(map(str,input().split()))

ans = []
j = 0
k = 0

for i in range(N*2):
    if i%2 == 1:
        ans.append(T[j])
        j += 1
    else:
        ans.append(S[k])
        k += 1
        
for i in range(N*2):
    print(ans[i],end="")

Submission status: Accepted

Solution code:
# 1行目の入力を数値として扱う
N = int(input())
# 2行目の入力を空白で分割された文字列として扱う
S, T = map(str, input().split())

# 答えの準備
res = ""

# N回繰り返し
for i in range(0, N):
    res += S[i] + T[i]

# 答えの出力
print(res)

Submission status: Accepted

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

for s in range(len(S)):
    c.extend([S[s],T[s]])
print("".join(c))

Submission status: Accepted

Solution code:
n = int(input())
[s,t] = [x for x in input().split()]
ls = list(s)
lt = list(t)

out =""
for i in range(n):
	out += ls[i]
	out += lt[i]

print(out)

Submission status: Accepted

Solution code:
n=int(input())
st=list(input().split())
ans=""
for i in range(2*n):
    if i%2==0:
        ans=ans+st[0][int(i/2)]
    else:
        ans=ans+st[1][int((i-1)/2)]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(u)

Submission status: Accepted

Solution code:
myStr, myNum, myString = "", int(input()), input().split(" ")
for a in range(0, myNum):
    myStr += myString[0][a] + myString[1][a]
print(myStr)

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())
S = [s for s in S]
T = [s for s in T]
U = ""

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

print(U)

Submission status: Accepted

Solution code:
from sys import stdin
n = int(stdin.readline())
s,t = map(str,input().split())
newstr = []
for i in range(n):
    newstr.append(s[i])
    newstr.append(t[i])
print("".join(newstr))

Submission status: Accepted

Solution code:
import math
import sys

m=10**9 + 7 
sys.setrecursionlimit(1000010)
N  = int(input())
(S,T)  = input().split()
# print(S,T)
for i in range(0,N):
    print(S[i], end="")
    print(T[i], end="")
print()

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

Submission status: Accepted

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



LS = list(S)
LT = list(T)
ANS = ""

for i in range(N):#0スタートである事に注意。
  ANS = ANS + LS[i]
  ANS = ANS + LT[i]
  
print(ANS)#文字の連結

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
s=list(input())
s,t=s[:n],s[n+1:]
ans=[0]*2*n
for i,j in zip(s,t):
  print(i,end="")
  print(j,end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def answer(N, S, T):
  sList = list(S)
  tList = list(T)
  result = ""
  for i in range(N):
    result = result + sList[i] + tList[i]
  return result

N = int(input())
S, T = input().split()
X = answer(N, S, T)
print(X)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
N=int(input())
S,T=input().split()
for i in range(N):
    sys.stdout.write(S[i])
    sys.stdout.write(T[i])

Submission status: Accepted

Solution code:


_ = input()

S, T = input().split()

ls = [''.join(tp) for tp in zip(S, T)]

print(''.join(ls))

Submission status: Accepted

Solution code:
n = int(input())

s, t = input().split()
answer = ""
for i in range(0,n):
    z = (s+t)[i::n]
    answer += z

print(answer)

Submission status: Accepted

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

line = ""

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

print(line)

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

a=[]
for x in range(n):
    a.append(string_list[0][x])
    a.append(string_list[1][x])
print("".join(a))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A,B = input().split()
tmp = [[] for _ in range(N*2)]
M = 2*N
for i in range(0,N):
	tmp[2*i]=A[i]
	tmp[2*i+1]=B[i]
ans = "".join(tmp)
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())
s,t = input().split()
out = []

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

print(''.join(out))

Submission status: Accepted

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

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

print(word)

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

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

Submission status: Accepted

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

print(output)

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()
s=list(s)
t=list(t)
u=[''*2*n]
for a,b in zip(s,t):
    u.append(a)
    u.append(b)
u=''.join(u)
print(u)

Submission status: Accepted

Solution code:
num = int(input())
words = input().split(" ")
w1 = words[0]
w2 = words[1]
ans = ""

for i in range(num):
  ans = ans + w1[i] + w2[i]

print(ans)

Submission status: Accepted

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

x = ""
for i in range(0, n):
    x += "{}{}".format(s[i], t[i])
print(x)

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

Submission status: Accepted

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

Submission status: Accepted

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


class TestB(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think('ip', 'cc'), 'icpc')

    def test_2(self):
        self.assertEqual(think('hmhmnknk', 'uuuuuuuu'), 'humuhumunukunuku')

    def test_3(self):
        self.assertEqual(think('aaaaa', 'aaaaa'), 'aaaaaaaaaa')


def solve():
    s, t = read()
    result = think(s, t)
    write(result)


def read():
    n = read_int(1)[0]
    buf = read_line(n=2 * n + 1)
    return buf.split(" ")


def read_int(n):
    return read_type(int, n)


def read_float(n):
    return read_type(float, n)


def read_type(t, n):
    return list(map(lambda x: t(x), read_line().split(' ')))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(s, t):
    buf = ''
    for ss, tt in zip(s, t):
        buf += ss
        buf += tt
    return buf


def write(result):
    print(result)


if __name__ == '__main__':
    # unittest.main()
    solve()

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
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=input().split()
s=list(s)
t=list(t)
st=[]
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 s,t in zip(S,T):
	ans += s+t
print(ans)

Submission status: Accepted

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

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

print(tmp)

Submission status: Accepted

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

ans=[]

for i in range(len(S)):
    ans.append(S[i])
    ans.append(T[i])
    
ANS=''

for i in ans:
    ANS+=i    

print(ANS)

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

print("".join(map(str,ans)))

Submission status: Accepted

Solution code:
n = int(input())

s, t = list(map(str, input().split()))

s = list(s)
t = list(t)
ans = ''
cs = 0
ct = 0

for i in range(n*2):
    if i % 2 == 0:
        ans += s[cs]
        cs += 1
    else:
        ans += t[ct]
        ct += 1
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:
n = int(input())
a,b=map(str,input().split())
an = ""

alist = list(a)
blist = list(b)

for i in range(n):
    an += alist[i]
    an += blist[i]

print(an)

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(" ")
_str = ""
for x in range(0,n):
    _str += s[x]+t[x]
print(_str)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
a, b = map(str,input().split())
a_li = list(a)
b_li = list(b)
ans = []

for i in range(n):
    ans.append(a_li[i])
    ans.append(b_li[i])
print(*ans,sep="")

Submission status: Accepted

Solution code:
length = int(input())

s, t = map(str, input().split())

newString = ''
p = 0
if len(s) == length and len(t) == length:
    ls = (c for c in s)
    lt = (c for c in t)
    while (p != length):
        temString = next(ls) + next(lt)
        newString += temString
        p += 1
    print(newString)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
D = input().split()
A = str(D[0])
B = str(D[1])
C = ""
for i in range(0,n):
    str = (A + B)[i::n]
    C += str
print(C)

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)

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:
def main():
    N = int(input())
    S, T = input().split(' ')

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
str = [input() for i in range(2)]

N = int(str[0])
S, T = str[1].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()

u = "".join(i+j for i, j in zip(s, t))

print(u)

Submission status: Accepted

Solution code:
N=int(input())
st=input()
S,T=(st.split(' '))
re=''.join([(a+b)for a,b in zip(S,T)])
print(re)

Submission status: Accepted

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

print(output)

Submission status: Accepted

Solution code:
N=int(input())
a,b=input().split()
List=[]
x=0
for i in range(2*N):
  if i%2 == 0:
    x=a[i//2]
    List.append(x)
  else:
    x=b[(i-1)//2]
    List.append(x)

p=List[0]
for i in range(1,len(List)):
    p=p+List[i]
    
print(p)

Submission status: Accepted

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

ans = ""

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

Submission status: Accepted

Solution code:
N = input()
SandT = input().split()

result = ""
for x in range(int(N)):
    result += SandT[0][x] + SandT[1][x]

print(result)

Submission status: Accepted

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

answer = ""

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

print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)


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

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

print(ans_str)

Submission status: Accepted

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

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

print(out)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
print("".join(map(lambda s,t:s+t, S, T)))

Submission status: Accepted

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


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

    ans = ''
    for x, y in zip(list(S), list(T)):
        ans += ''.join([x, y])

    print(ans)


if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
import sys
N=int(sys.stdin.readline())
A,B=sys.stdin.readline().split()
new=[]
for i in range(N):
    new.append(A[i])
    new.append(B[i])
print(''.join(new))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result = []

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

print(''.join(result))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
S, T = input().split()
st = []
for i in range(N):
  st.append(S[i])
  st.append(T[i])
print(''.join(st))

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):
    l=a[i]+b[i]
    print(l,end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = int(input())
s = input().split()
#print(s)
ans = []

k =  l * 2
i = 0
while(i < l):
    #print(s[0][i])
    ans.append(s[0][i])
    ans.append(s[1][i])
    i += 1

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

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 =[list(x) for x in input().split()]
ans =[]
for i in range(N):
  ans.append(S[i]+T[i])
mojiretu = ''
for x in ans:
    mojiretu += x
    
print(mojiretu)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n=int(input())
a, b= map(str, input().split())
#print(a)
#print(b)
slist=[]
for i in range(0,n):
    slist.append(a[i])
    slist.append(b[i])
print(''.join(slist))

Submission status: Accepted

Solution code:
N = int(input())

S, T = [s for s in input().split()]

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

n = input()[:-1]
s, t = input()[:-1].split(" ")

r = ""
for s0, t0 in zip(s, t):
    r = r + s0 + t0

print(r)

Submission status: Accepted

Solution code:
n = int(input())
l = list(str(x) for x in input().split())

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

Submission status: Accepted

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

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 = [i for i in input().split()]

SL = list(S)
TL = list(T)
L = []

for i in range(N):
  L.append(SL[i])
  L.append(TL[i])

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

Submission status: Accepted

Solution code:
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
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()))
MOD = 10**9 + 7

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

s = list(s)
t = list(t)

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

print(mojiretu)

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
for i,(j,k) in enumerate(zip(S,T)):
    if i==0:
        str_com=j
        str_com+=k
    else:
        str_com += j
        str_com += k
print(str_com)

Submission status: Accepted

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

c = []
for d in range(n):
  c.append(a[d])
  c.append(b[d])
print(''.join(c))

Submission status: Accepted

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

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

ans = ""
for i in range(N):
    ans = ans + S_list[i] + T_list[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="")