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()
s=list(s)
t=list(t)
new=[]
for i in range(n):
  new.append(s[i])
  new.append(t[i])

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

Submission status: Accepted

Solution code:
from sys import stdin


if __name__ == '__main__':
    N = int(stdin.readline().rstrip())
    S, T = stdin.readline().rstrip().split()
    
    result = ''
    for i in range(N):
        result += S[i]
        result += T[i]
    print(result)

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

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

Submission status: Accepted

Solution code:
# import numpy as np
import sys
input = sys.stdin.readline

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

s0,t0 = map(str,input().split())
s = list(s0)
t = list(t0)
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 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	A = inputInt()
	T = input()

	ST = T.split()

	ans = ""
	for i in range(A):
		ans += ST[0][i]
		ans += ST[1][i]

	print(ans)



if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

ans = []
for i in range(2*N):
    if i % 2 == 0:
        ans.append(S[i//2])
    else:
        ans.append(T[i//2])

print("".join(ans))

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

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

s = ''
for i in range(n):
    s += s_t_list[0][i]
    s += s_t_list[1][i]

print(s)

Submission status: Accepted

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

result = ""

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

print(result)

Submission status: Accepted

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

g = ""
for i in range(N):
    g = g + moji[0][i] + moji[1][i]

print(g)

Submission status: Accepted

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

Submission status: Accepted

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

#単入力
n=int(input())

#複数入力
s,j=(x for x in input().split())

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

Submission status: Accepted

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

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

print(''.join(ans))

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    S, T = input().split()

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


main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import collections
#sys.setrecursionlimit(100000)

n=int(input())

tmp = input().split()
t1 = tmp[0]
t2 = tmp[1]
t3=""

for i in range(n):
	t3=t3+t1[i]
	t3=t3+t2[i]
print(t3)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Leng = int(input())

StrList = input().split(" ")

string = ""
for i in range(Leng):
  string += StrList[0][i]
  string += StrList[1][i]
print(string)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
from fractions import gcd
from string import ascii_uppercase as ABC
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
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())
c1,c2 = input().split(" ")
c1 = list(c1)
c2 = list(c2)
c = []
for i in range(n):
  c.append(c1[i])
  c.append(c2[i])

print("".join(c))

Submission status: Accepted

Solution code:

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

    print(ans)
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
ans = ''
for k in range(N):
    ans += S[k] + T[k]
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]+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:
def main():
    N = int(input())
    s,t = map(str, input().split())

    ans = []
    for i, j in zip(s, t):
        ans.append(i)
        ans.append(j)
    
    print("".join(ans))

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
n = int(input())-1
li = input().split()
s=li[0]
t=li[1]
sli=list(s)
tli=list(t)
i=0
stat=''
while i<=n:
    stat+=sli[i]+tli[i]
    i+=1


print(stat)

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

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])
a="".join(a)
print(a)

Submission status: Accepted

Solution code:
n = int(input())
moji = input()
S = moji.split(" ")[0]
T = moji.split(" ")[1]

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

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

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

Submission status: Accepted

Solution code:
l = input()
a, b = list(input().split())
x = ''
for i, j in zip(a,b):
    x = x + str(i) + str(j)
print(x)

Submission status: Accepted

Solution code:
from sys import stdout
printn = lambda x: stdout.write(x)
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
DBG = True # and False
BIG = 999999999
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

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

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

print(str)

Submission status: Accepted

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

for ss, tt in zip(S, T):
    print('{}{}'.format(ss, tt), end='')
print()

Submission status: Accepted

Solution code:
n = int(input())
s1,s2 = map(str,input().split())

s = ""
#a,b = map(int,input())
#L = list(map(int,input().split()))
for i in range(n):
    s += s1[i]+s2[i]
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

Solution code:
N = int(input())
s_string, t_string = input().split(' ')

output = ''

for i in range(len(s_string)):
    output += s_string[i] + t_string[i]

print(output)

Submission status: Accepted

Solution code:
N = int(input())
S,T=input().split()
ans = []
for i in range(len(S)):
    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())
st = ''

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

print(st)

Submission status: Accepted

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

print(s)

Submission status: Accepted

Solution code:


n = int(input())

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

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

Submission status: Accepted

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

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

print(L)

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
st=list(map(str,input().split()))
s=list(st[0])
t=list(st[1])
com = []
for i in range(len(s)):
    com.append(s[i])
    com.append(t[i])
print("".join(com))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# B - Strings with the Same Length
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:
_ = input()
S, T = input().split()

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
import sys
input  = sys.stdin.readline


def solve():
    N = int(input())
    S,T = map(str,input().strip().split())
    rtn = ""
    for i in range(N):
    	rtn += "{}{}".format(S[i],T[i])
    print(rtn)


if __name__ == '__main__':
    solve()

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

#print(S,T)

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

Submission status: Accepted

Solution code:
from collections import defaultdict
import sys
import math
from datetime import datetime
import re
import math
def sol(n, S, T):
    ans = ""
    for i in range(n):
        ans += S[i]
        ans += T[i]
    return ans





do_submit = True
#do_submit = False

def input_parse(input_str):
    lines = [x.strip() for x in input_str.split("\n") if x.strip()]
    parsed_lines = [list(map(str, line.split())) for line in lines]
    print(parsed_lines)
    # n = int(parsed_lines[0][0])
    # k = int(parsed_lines[0][1])
    S = parsed_lines[0][0]
    return S


if not do_submit:
    S = input_parse("""
    1905
    """)
    print(sol(S))

    S = input_parse("""
    0112
    """)
    print(sol(S))

    S = input_parse("""
    1700
    """)
    print(sol(S))

    S = input_parse("""
    0000
    """)
    print(sol(S))

    S = input_parse("""
    1001
    """)
    print(sol(S))



else:
    #A, B = list(map(int, input().split()))
    n = int(input())
    S, T = list(map(str, input().split()))
    # S = input()
    # T = input()
    print(sol(n, S, T))

    # S = input().strip()
    # print(sol(S))

Submission status: Accepted

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

print("".join(i+j for i, j in zip(S, T)))

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

ans = [""] * (2 * N)

for n in range(N):
    ans[n*2] = S[n]
    ans[n*2+1] = T[n]

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(*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:
import sys
import math
import bisect
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop


def LI(): return [int(x) for x in sys.stdin.readline().split()]


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


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


# A
def A():
    a = I()
    b = I()
    print(6 - a - b)
    return


# B
def B():
    n = I()
    s, t = input().split(' ')
    ans = []
    for i in range(n):
        ans.append(s[i])
        ans.append(t[i])
    print(''.join(ans))
    return


# C
def C():
    return


# D
def D():
    return


# E
def E():
    return


# F
def F():
    return


# Unittest
def resolve():
    B()
    return


# Solve
if __name__ == "__main__":
    B()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

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

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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

N = int(input())
L = input().strip().split(" ")
S = L[0]
T = L[1]

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

print(K)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(new_string)

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

Submission status: Accepted

Solution code:
input()
a,b = input().split()
a = list(a)
b = list(b)
c = []
i = 0
for _ in a:
  c.append(a[i])
  c.append(b[i])
  i += 1
print(''.join(c))

Submission status: Accepted

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

for n in range(N):
  s1 = s[n]
  t1 = t[n]
  
  o = o + s1 + t1
  
print(o)

Submission status: Accepted

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

output = ''

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

print(output)

Submission status: Accepted

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

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

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

print(R)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
n = int(input())
ans = ""
s, t = map(str, input().split())
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()
result = ''
for i in range(N):
    result += S[i] + T[i]
# X1_list = [int(input()) for i in range(N)]
# X2_list = [list(map(int,input().split())) for i in range(N)]
#print(S,T)
print(result)

Submission status: Accepted

Solution code:
import collections
import math
import operator as op
from functools import reduce
import numpy as np
import math
import bisect


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

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

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
import datetime
import itertools
import sys
import copy

# 入力
#N = int(input())
#S = str(input())
#N, A, B = map(int, input().split())
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 a,b in zip(s,t):
  print(a+b,end="")

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

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:
import sys; readline = sys.stdin.readline
from collections import deque

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

ans = ''.join(sum(zip(S, T), tuple()))

print(ans)

Submission status: Accepted

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

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

print(s)

Submission status: Accepted

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

N = int(input())
S = input()
s = S.split()

new_s = ''
for i in range(N):
    new_s += s[0][i]
    new_s += s[1][i]

print(new_s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

s=''
for a,b in zip(A,B):
    s+=a
    s+=b
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

ans=[]
for i in range(N):
  ans.append(A[i])
  ans.append(B[i])


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

Submission status: Accepted

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

print("".join(ans))

Submission status: Accepted

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

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

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


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

Submission status: Accepted

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

rslt = ""
for idx, s in enumerate(S):
    rslt = rslt + (s + T[idx])

print(rslt)

Submission status: Accepted

Solution code:
# 入力が10**5とかになったときに100ms程度早い
import sys
read = sys.stdin.readline


def read_ints():
    return list(map(int, read().split()))


def read_a_int():
    return int(read())


def read_matrix(H):
    '''
    H is number of rows
    '''
    return [list(map(int, read().split())) for _ in range(H)]


def read_map(H):
    '''
    H is number of rows
    文字列で与えられた盤面を読み取る用
    '''
    return [read()[:-1] for _ in range(H)]


def read_col(H, n_cols):
    '''
    H is number of rows
    n_cols is number of cols

    A列、B列が与えられるようなとき
    '''
    ret = [[] for _ in range(n_cols)]
    for _ in range(H):
        tmp = list(map(int, read().split()))
        for col in range(n_cols):
            ret[col].append(tmp[col])

    return ret


N = read_a_int()
S, T = list(input().split())

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

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

ans = ""

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()

ans = ""

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

out = []

for s,t in zip(S,T):
  out.append(s)
  out.append(t)
  
print(''.join(out))

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

Submission status: Accepted

Solution code:
#import sys
MOD = 10 ** 9 + 7
#input = sys.stdin.readline
import math
import itertools

#import bisect

def sosuhante(n):
    for k in range(2, int(math.sqrt(n))+1):
        if n% k ==0:
            return False
    return True
def cmb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2,r+1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p-1,r,p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def kingaku(a,b,n):
    keta=len(str(n))
    return a*n+b*keta

def my_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default


def main():
#    h,w,a,b = map(int, input().split())
#    c = [[0 for j in range(n)] for i in range(n)]
    n=int(input())
    s,t=map(str,input().split())
    s=list(s)
    t=list(t)
    c=[]
    for i in range(n):
        c.append(s[i])
        c.append(t[i])
    print("".join(c))

if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

for z in zip(S, T):
  print(*z, sep='', end='')
print()

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:
"""
Atcoder_Beginner_Contest_148
B

"""
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000)

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

print(result)

Submission status: Accepted

Solution code:
n=int(input())
s=input().split()
i=0
j=0
flag=0
l=list()
while(i<n or j<n):
    if(flag==0):
        l.append(s[0][i])
        i+=1
        flag=1
    else:
        l.append(s[1][j])
        j+=1
        flag=0
for i in range(len(l)):
    print(l[i],end="")

Submission status: Accepted

Solution code:
import math


def inputIntList():
    return [int(s) for s in input().split()]


def inputInt():
    return int(input())


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

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

    return ans


if __name__ == "__main__":
    print(main())

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

Submission status: Accepted

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

Submission status: Accepted

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