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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    n = int(input())
    s, t = map(str, input().decode().split())
    s = list(s)
    t = list(t)
    ans = []
    for i in range(n):
        ans.append(s[i])
        ans.append(t[i])
    print(*ans, sep='')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

Solution code:
import itertools
import math
import fractions
import functools

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    # import sys
    # input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

# check
o = ""
for i in range(N):
    o += S[i] + T[i]

print(o)

Submission status: Accepted

Solution code:
# ABC148B

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

lis = [""]*2*N
for i in range(N):
    lis[2*i] = a[i]
    lis[2*i+1] = b[i]

print("".join(lis))

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

Submission status: Accepted

Solution code:
n = int(input())

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

st = []

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

Submission status: Accepted

Solution code:
from itertools import chain

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

print(''.join(chain.from_iterable(zip(S, T))))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

new_str = ''
count = 0

for i in range(n):
  new_str += s[count]
  new_str += t[count]
  count += 1
  
print(new_str)

Submission status: Accepted

Solution code:
n = int(input())
x = input().split()
s = x[0]
t = x[1]
a = []
s_i = 0
t_i = 0
for i in range(0,n*2):
  if(i%2 == 0):
    a.append(s[s_i])
    s_i = s_i + 1
  else:
    a.append(t[t_i])
    t_i = t_i + 1
      
b = ''.join(a)
print(b)

Submission status: Accepted

Solution code:
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect
import itertools
import heapq


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


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



def string_to_int(string):
    return list(map(lambda x: int(x), string.split()))


if __name__ == "__main__":
    N = int(input())
    [S, T] = input().split()
    ret = solve(N, S, T)
    print(ret)

Submission status: Accepted

Solution code:
import fileinput

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

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

print(ss)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat May  9 16:05:56 2020

@author: shinba
"""


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
count = int(input())
line = input().split()
n = line[0]
m = line[1]
lis = []
for i in range(len(n)):
    lis.append(n[i])
    lis.append(m[i])

for j in lis:
    print(j,end = "")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

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


print(ans)

Submission status: Accepted

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

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 = [i for i in input().split()]
S = list(s[0])
T = list(s[1])
for j in range(N):
    print(S[j] + T[j], end='')

Submission status: Accepted

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

#n = int(input())
#l = list(map(int, input().split()))

'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''

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

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

Submission status: Accepted

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

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

print(apple[1:2 * n + 1])

Submission status: Accepted

Solution code:

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

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

print(res)

Submission status: Accepted

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

U = ''

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
def r(s, t):
  if len(s) == 1:
    return s+t
  return s[0]+t[0]+r(s[1:], t[1:])
print(r(s, t))

Submission status: Accepted

Solution code:
n=int(input())
s=list(input().split())
s1=[]
s2=[]
S=[]
a=''
for i in s[0]:
  s1.append(i)
for j in s[1]:
  s2.append(j)
for k in range(n):
  S.append(s1[k])
  S.append(s2[k])
for l in range(2*n):
  a+=S[l]
print(a)

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code

def resolve():
    N,=pin()
    S,T=lispin(str)

    for g in zip(S,T):
        print(*g,sep="",end="")
    print()
    
#%%submit!
resolve()

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:
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    N = II()
    S,T = input().split()
    ans = ''
    for s,t in zip(S,T):
        ans += s
        ans += t
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    s,t=input().split()
    for i in range(n):
        u=s[i]+t[i]
        print(u,end='')
    # このままだと最後の改行がないから最後の改行をさせるために
    # print関数はデフォルトで改行になってるから()の中はいらない
    print()
resolve()

Submission status: Accepted

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
#from fractions import gcd
#from math import gcd
import sys
def I(): return int(input())  # '123' -> 123
def Is(): return map(int, input().split())  # '123 456' -> 123, 456
def LI(): return list(map(int, input().split()))  # '123 456' -> [123, 456]
def TI(): return tuple(map(int, input().split()))  # '123 456' -> (123, 456)
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  # 'aa bb' -> 'aa','bb' or ['aa','bb']
def LS(): return list(input())  # 'abc123' -> ['a','b','c','1','2','3']
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

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

Submission status: Accepted

Solution code:
a=int(input())
b=list(map(str,input().split()))
c=b[0]
d=b[1]
e=''
for i in range(a):
  e+=c[i]
  e+=d[i]
print(e)

Submission status: Accepted

Solution code:
# B - Strings with the Same Length
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 - 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:
n = int(input())
s,t = map(str, input().split())
ans = ''
for i in range(n):
    ans += s[i]
    ans += t[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = 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()
l = []
for i in range(n):
    l.append(s[i])
    l.append(t[i])
print(''.join(l))

Submission status: Accepted

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

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


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

Submission status: Accepted

Solution code:
import sys

# import math
# import bisect

# import copy
# import heapq
# from collections import deque
# import decimal

# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7

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


# ===CODE===


def main():
    n = ni()
    a,b = map(str, input().split())

    s=""
    s = [i+j for i, j in zip(a,b)]
    print("".join(s))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(N):
    ans.extend([S[i], T[i]])

print(*ans, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

S=list(S)
T=list(T)

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

Submission status: Accepted

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

s=[]
t=[]
for i in S:
    s.append(i)
for i in T:
    t.append(i)
l=[]
for i in range(n):
    l.append(s[i])
    l.append(t[i])
t=""
for i in range(len(l)):
    t+=l[i]
print(t)

Submission status: Accepted

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

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

print(''.join(U))

Submission status: Accepted

Solution code:
def main():
    input()
    l = list(input().split())
    ans = []
    for i in range(len(l[0])):
        ans.append(l[0][i])
        ans.append(l[1][i])
    print(''.join(ans))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(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 a, b in zip(s, t):
    ans += a + b
print(ans)

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    n=int(input())
    s,t=input().split()
    l=[]
    for i in range(n):
        l.append(s[i]+t[i])
    print(''.join(l))

resolve()

Submission status: Accepted

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

print(*ans,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(solve())

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
r = ""
i = 0
while i < N:
    r += S[i]
    r += T[i]
    i += 1
print(r)

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__=='__main__':
  main()

Submission status: Accepted

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

for i in range(2*n):
    if i % 2 == 0:
        r += s[int(i/2)]
    else:
        r += t[int((i-1)/2)]
print(r)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

Solution code:
n=int(input())
u=list(input().split())
s=list(u[0])
t=list(u[1])
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())
x =''
for i in range(n):
    
    x +=s[i]
    x +=t[i]
    
    
print(x)

Submission status: Accepted

Solution code:
import sys
import math

n = int(input())
s, t = input().split()
a = []
for i in range(n):
    a.append(s[i])
    a.append(t[i])
    
for i in range(len(a)):
    print(a[i], end="")

Submission status: Accepted

Solution code:
n= int(input())
s,t = input().split()
slist= list(s)
tlist= list(t)
prilist=[]
for k in range(n):
  prilist.append(slist[k])
  prilist.append(tlist[k])
  
ans=''.join(prilist)
print(ans)

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 = map(str,input().split())
s = list(S)
t = list(T)
g = []
for i in range(n):
    g.append(s[i])
    g.append(t[i])
print(''.join(g))

Submission status: Accepted

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

strings =''

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

print(strings)

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

for i, j in zip(a, b):
  num.append(i)
  num.append(j)

print(''.join(num))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    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:
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=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(' ')
a = ''
for s,t in zip(S,T):
    a += s+t
print(a)

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
n = int( input())
li = input().split()
lia = list(map(str, li[0]))
lib = list(map(str, li[1]))
x = ""
for i in range(n):
    x += lia[i]
    x += lib[i]
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N, S, T = map(str, open(0).read().split())
    I = []
    for i in range(0, int(N)):
        I.append(S[i] + T[i])
    print(''.join(I))


main()

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())
[s,t] = [i for i in 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("".join([s+t for s,t in zip(S,T)]))

Submission status: Accepted

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

new = ''
for i in range(max_num):
    new += S[i]
    new+= T[i]
print(new)

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:
count = int(input())
first, second = list(map(str, input().split()))

ret = ""
for i in range(count):
    ret += first[i] + second[i]

print(ret)

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

answer = ''
for s_char, t_char in zip(S, T):
  answer += s_char + t_char
print(answer)

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:
#!/usr/bin/env python3

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

for i, j in zip(S, T):
    ans += i
    ans += j

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s = input()
z = s.split()
a = z[0]
b = z[1]
x = 0
c = ''
while x < n:
  c += (a[x]+b[x])
  x += 1
print(c)

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:
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N = ri()
S, T = rs().split()

ret = [0]*(len(S)+len(T))

for i in range(len(S)+len(T)):
	if i % 2 == 0:
		ret[i] = S[i//2]
	else:
		ret[i] = T[i//2]
print(''.join(ret))

Submission status: Accepted

Solution code:
import sys
n = int(sys.stdin.readline())
s, t = map(str, sys.stdin.readline().split())
i = 0
text = ''
while i < n:
  text += s[i] + t[i]
  i += 1
print(text)

Submission status: Accepted

Solution code:
n=int(input())
a=input().split()
l=[]
for i in range(n):
    b=a[0][i]+a[1][i]
    l.append(b)
mojiretu = ' '
for x in l:
    mojiretu += x  
print(mojiretu)

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

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

print(new)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(res)

Submission status: Accepted

Solution code:
N = int(input())
S, T = (x for x in input().split())
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())
string=input()
S=string[0:N]
T=string[N+1:2*N+1]
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()
ans = ''
for i in range(n):
    ans += s[i] + t[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
ss, ts = map(str, input().split())

ans = ""

i = 0
while i < n:
  ans += ss[i]
  ans += ts[i]
  i += 1

print(ans)

Submission status: Accepted

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

ans = ""

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

print(ans)

Submission status: Accepted

Solution code:

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

a = []
for i in range(n):
  a+= s[i]+t[i]
L=''.join(a)
print(L)

Submission status: Accepted

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

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