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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
ans = 0
inf = float("inf")

n = k()
s,t = map(str,input().split())
a = []
for i in range(n):
    a.append(s[i]+t[i])

print("".join(a))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n, (s, t) = int(input()), input()[:-1].split()
print(''.join(s[i] + t[i] for i in range(n)))

Submission status: Accepted

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

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, j in zip(S,T):
    ans += i + j
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


n = int(input())
s,t = input().split()
ans = "".join(item[0]+item[1] for item in  zip(s,t))
print(ans)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

while T:
    if len(S) == len(T):
        result.append(S[0])
        S = S[1:]
    else:
        result.append(T[0])
        T = T[1:]

print(''.join(result))

Submission status: Accepted

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

print(m[1::])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))


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

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = [0]*(N*2)
Scount = 0
Tcount = 1
for i in S:
    ans[Scount] = i
    Scount += 2
for j in T:
    ans[Tcount] = j
    Tcount += 2

print(''.join(ans))

Submission status: Accepted

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

ans = ""
for ss, tt in zip(s, t):
    ans += ss + tt
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()
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()
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()
print(''.join([X+Y for (X,Y) in zip(S,T)]))

Submission status: Accepted

Solution code:
N = int(input())
K, X = input().split()

print(*[K[i] + X[i] for i in range(N)], sep="")

Submission status: Accepted

Solution code:
input()
s, t = input().split()
for i,j in zip(s,t):
    print(i,j,sep='', end = '')

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

ans=S

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

Submission status: Accepted

Solution code:
input()
print(''.join(sum(list(map(list, zip(*input().split()))), [])))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(''.join(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(char[::-1])

Submission status: Accepted

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

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

print(*char, sep='')

Submission status: Accepted

Solution code:
from collections import deque

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

char = deque()

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

print(*char, sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

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

    print(''.join(ans))

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

ans = ""

for i, j in zip(S_list, T_list):
    ans += i + j

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
n=int(input())
s,t=input().split()
print("".join([s[i]+t[i]for i in range(n)]))

Submission status: Accepted

Solution code:
n = input()
s , t=input().split()
print(*[s + t for s, t in zip(s, t)],sep='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc148/tasks/abc148_b
# string manipulation
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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n= int(input())
list=input()
strlist=list.split(' ')
output=''
for i in range(n):
    output=output+strlist[0][i]+strlist[1][i]


print(output)

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

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

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

Submission status: Accepted

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

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

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

print(c)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

n=int(input())
s,t=map(str,input().split())
ans=[]
for i in range(n):
    ans.append(s[i])
    ans.append(t[i])
print(*ans,sep="")

Submission status: Accepted

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

ans = ""

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print("{}".format(ret))

Submission status: Accepted

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

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]+t[i],end="")

Submission status: Accepted

Solution code:
N = int(input())

S,T = input().split()

string = ""

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
lt = int(input())

s,t = map(str, input().split())
string = ""
for i in range(0, lt):
  string = string + s[i] + t[i]
  
print(string)

Submission status: Accepted

Solution code:
N = int(input())
list1,  list2 = input().split()
str = ''

for i, j in zip(list1, list2):
  str += f'{i}{j}'

print(str)

Submission status: Accepted

Solution code:
number = int(input())
list1,list2 = input().split(" ")
str=""
for i in range(number):
  str=str+list1[i]+list2[i]
print(str)

Submission status: Accepted

Solution code:
n=int(input())
list=input().split()
a=list[0]
b=list[1]
def split(w):
    return [all for all in w]
a=split(a)
b=split(b)
c=0
str=""
for i in range(len(a)):
  str=a[c]+str
  str=b[c]+str
  c+=1
print(str[::-1])

Submission status: Accepted

Solution code:
import sys

def I(): return int(sys.stdin.readline().rstrip())
def S(): return sys.stdin.readline().rstrip()

N = I()
S,T = S().split()
S = list(S)
T = list(T)

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

Submission status: Accepted

Solution code:
# 148 B

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 = input()
s = list(map(str, input().split()))
news = ""
for i in range(int(n)):
    news += s[0][i] + s[1][i]
print(news)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
S,T = input().split()
txt = ''
for si,ti in zip(S,T):
    txt += si+ti
print(txt)

Submission status: Accepted

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

print(out)

Submission status: Accepted

Solution code:
N=int(input())
a1=input().split()
S,T=list(a1[0]),list(a1[1])
empty=[]
for i in range(0,N):
    x=S[i]+T[i]
    empty.append(x)
y=''.join(empty)
print(y)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
Ss, Ts = input().split()

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

print(anss)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
# 148b

from sys import stdin

N = int(stdin.readline().strip())
S, T = stdin.readline().strip().split(" ")

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
l=[]
for i in range(2*n):
    if i%2==0:
         l.append(s[i//2])
    else:
        l.append(t[(i-1)//2])
l=''.join(l)

print(l)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
B - Strings with the Same Length
https://atcoder.jp/contests/abc148/tasks/abc148_b

"""
import sys


def solve(S, T):
    return ''.join(s+t for s, t in zip(S, T))


def main(args):
    _ = input()
    S, T = input().split()
    ans = solve(S, T)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[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="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=map(str,input().split())
a=""
for i in range(2*n):
    if i%2==0:
        a=a+s[(i)//2]
    else:
        a=a+t[(i-1)//2]
print (a)

Submission status: Accepted

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



if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
length = int(input())
first_string, second_string = input().split()
first_list = list(first_string)
second_list = list(second_string)
result_list = []
for i in range(length):
  result_list.append(first_list[i])
  result_list.append(second_list[i])
  
result = "".join(result_list)
print(result)

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:
def q_b():
    n = int(input())
    st = input().split()
    s = st[0]
    t = st[1]

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

if __name__ == '__main__':
    q_b()

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
s, t = M()
ans = ''
for i in range(N):
    ans += s[i]
    ans += t[i]
print(ans)

Submission status: Accepted

Solution code:
n = input()
s, t = input().split()
print(*[s+t for s,t in zip(s,t)],sep="")

Submission status: Accepted

Solution code:
n = int(input())
str_list = list(map(list,input().split(' ')))

ans_list = []
for i in range(n):
    ans_list.append(str_list[0][i])
    ans_list.append(str_list[1][i])
ans_str = ''.join(ans_list)
print(ans_str)

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:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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




    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())
x = input().split()
a, v = x[0], x[1]
res=""
j=0
k=0
for i in range(2*n):
	if i%2==0:
		res +=a[j]
		j +=1
	else:
		res +=v[k]
		k+=1
print(res)

Submission status: Accepted

Solution code:
n = int(input())

s, t = input().split()

ans = ''

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

val = ''
for i in range(len(s)):
    val += s[i] + t[i]
print(val)

Submission status: Accepted

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

print(ST)

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
a,b=list(input().split())
ans=[]
for i in range(2*n):
    if i%2==0:
        ans.append(a[i//2])
    else:
        ans.append(b[i//2])
ansl=""
for i in ans:
    ansl+=i
print(ansl)

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

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

print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = int(input())
b = input().split()
c = []
for i in range(a * 2):
  if i % 2 == 0:
    c.append(b[0][i // 2])
  else:
    c.append(b[1][(i - 1) // 2])
for f in c:
  print(f,end="")

Submission status: Accepted

Solution code:

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

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

print(ans)

Submission status: Accepted

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

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

print(u)

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

Submission status: Accepted

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

Submission status: Accepted

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

pt = (p + t for p, t in zip(s, t))
print(''.join(pt))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
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())
ans = [s_+t_ for s_,t_ in zip(s,t)]
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())
s,t = input().split()
hoge = []
for i in range(n):
    hoge.append(s[i]+t[i])
print(''.join(hoge))

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

s = ""

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

print(s)

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

Submission status: Accepted

Solution code:
"""
N = list(map(int,input().split()))
S = [str(input()) for _ in range(N)]
S = [list(map(int,list(input()))) for _ in range(h)] 
print(*S,sep="")
"""

import sys
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()
inf = float("inf") # 無限

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

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

Submission status: Accepted

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

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

# 上のワンライナーを長ったらしく書くとこう
# ans = str()
# for i in range(n):
#     ans += s[i]
#     ans += t[i]

# print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A, B = input().split()
LA = list(A)
LB = list(B)
LC = []

for i in range(N):
    LC.append(LA[i])
    LC.append(LB[i])

print(''.join(LC))

Submission status: Accepted

Solution code:
leng = int(input())
R,L = input().split() 

ans = ''


for i in range(leng):
  ans += R[i] + L[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(n, s, t):
    answer = ''

    for x, y in zip(s, t):
        answer += (x + y)

    return answer

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

print(actual(n, s, t))