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

Submission status: Accepted

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

# n = int(2)
# s,t = "ip cc".split()

out = ""

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

print(out)

Submission status: Accepted

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

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

print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
S = input().split(" ")
s = S[0]
t = S[1]
for c1, c2 in zip(s, t):
    print(c1, end="")
    print(c2, 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,T=list(S),list(T)
x=list("a"*(N*2))
for i in range(0,N*2):
    if i%2==0:
        x[i]=S[i//2]
    else:
        x[i]=T[i//2]
x="".join(x)
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools

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=input()
S,T=input().split()
msg=""
for s,t in zip(S,T):
	msg+=s
	msg+=t
print(msg)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

print(n_s)

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

Submission status: Accepted

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

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

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 += s[i] + t[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print(u)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC 148: B – Strings with the Same Length
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 = input().split()
print(*[s + t for s, t in zip(S, T)], sep="")

Submission status: Accepted

Solution code:
#--Strings with the Same Length

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

s_str = list(S)
t_str = list(T)

ans = " "
connect = [0] * N

for num in range(N):
  connect[num] = s_str[num] + t_str[num]
  ans = ans + connect[num]

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


solve()

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

ans=""

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

print(ans)

Submission status: Accepted

Solution code:
from itertools import permutations as perm
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)

# お約束
args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def yesno(v, yes="Yes", no="No", upper=False):
    if upper:
        print([yes.upper(), no.upper()][not v])
    else:
        print([yes, no][not v])


def main():
    """エントリーポイント"""
    N = input(int)
    S, T = input(str, str)
    ans = ""
    for n in range(N):
        ans += S[n] + T[n]
    print(ans)


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    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 = map(list, 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())
m=''
for i in range(n):
  m+=s[i]+t[i]

print(m)

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

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

print(*ans, sep="")

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
for u,v in zip(s,t):
    print('{}{}'.format(u,v),end='')

Submission status: Accepted

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

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


ls = []
s, t = input().split()

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

mozi = ''. join(ls)

print(mozi)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def q2():
    N = int(input())
    S, T = (s for s in input().split())
    ans = ''
    for i in range(N):
        print('{}{}'.format(S[i], T[i]), end='')


if __name__ == '__main__':
    q2()

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = 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()
A = ""
for a, b in zip(S, T):
    A += a+b
print(A)

Submission status: Accepted

Solution code:
# ABC148B - Strings with the Same Length

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
string1 , string2 = map(str,input().split())
res = ''
j = 0
k = 0
for i in range((2*N)):
	if(i%2==0):
		res+=string1[j]
		j+=1
	else:
		res+=string2[k]
		k+=1
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())
base = input().split()
s = list(base[0])
t = list(base[1])
for i in range(n):
    print(s[i],end = "")
    print(t[i],end = "")

Submission status: Accepted

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

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
from itertools import count, cycle, repeat     # count(start[,step]), cycle(iter), repeat(elm[,n])
from itertools import groupby                  # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
from itertools import starmap                  # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    n = ii()
    s, t = input().split()
    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())
S, T= input().split()
ST=str()
for i in range(N):
  ST+=S[i]+T[i]
print(ST)

Submission status: Accepted

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

Submission status: Accepted

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

#https://atcoder.jp/contests/abc148/tasks/abc148_b

length = int(input())
a, b= [i for i in input().split()]

answer = ""
for i, j in zip(a,b):
    answer += i
    answer += j
print(answer)

Submission status: Accepted

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

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())
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=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 n in range(N):
    ans+=(S[n])
    ans+=(T[n])

print(ans)

Submission status: Accepted

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

print(text)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(str,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))






N=input1()
S,T=input2()
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]
  ans+=T[i]
print(ans)

Submission status: Accepted

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

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

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

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

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

Submission status: Accepted

Solution code:
n=int(input())
s,t=input().split()
a=[str(c) for c in s]
b=[str(c) for c in t]
x=["o"]*n*2
for i in range(n*2):
  if i%2==0:
    x[i]=a[i//2]
  else:
    x[i]=b[i//2]
print("".join(x))

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()
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()
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(list,input().split())
ans = ""
for a,b in zip(s,t):
    ans += a
    ans += b
print(ans)

Submission status: Accepted

Solution code:
# solution
import io

nim = int(input())

a, b = input().split()

for _a, _b in zip(a, b):
    print(_a + _b, end="")

Submission status: Accepted

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

res = "".join([i+j for i, j in zip(s, t)])

print(res)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

res = [(i+j) for i, j in zip(s, t)]
ans = ""
for i in range(n):
    ans += res[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s,t = map(str,input().split())
ans = ''
for x,y in zip(s,t):
    ans += x + y 
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='')
print()

Submission status: Accepted

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

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

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

print("".join(lists))

Submission status: Accepted

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    ans=""
    for i in range(N):
        ans+=S[i]+T[i]
    print(ans)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(N, S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(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:
def main():
    N = int(input())
    S, T = input().split()
    for i in range(N):
        print('{}{}'.format(S[i], T[i]), end='')
    print('')
main()

Submission status: Accepted

Solution code:
N = int(input())

S, T = input().split()
w = ''
for a,b in zip(S,T):
    w += a
    w += b

print(w)

Submission status: Accepted

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

Submission status: Accepted

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

a = ''


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

Submission status: Accepted

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

l=[]
for n in range(N):
    l.append(S[n])
    l.append(T[n])

print("".join(l))

Submission status: Accepted

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

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()
u = ''
for i in range(2*n):
    if i%2 ==0:
        u += s[i//2]
    else:
        u += t[(i-1)//2]
print(u)

Submission status: Accepted

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

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 s_, t_ in zip(s, t):
  ans += s_ + t_
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str, input().split())
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:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    S, T = sl()
    ret = []
    for n in range(N):
        ret.append(S[n])
        ret.append(T[n])
    print("".join(ret))


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
import os
import math

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

MOD = 10 ** 9 + 7


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = ii()
    S, T = sl()
    ret = []
    for n in range(N):
        ret.append(S[n])
        ret.append(T[n])
    print(*ret,sep="")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# B - Strings with the Same Length

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate, groupby
    #from itertools import product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

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

if __name__ == '__main__':
    main()

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

for i in range(len(A)):
    print(A[i], end = "")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
for i in range (len(S)):
    print(S[i]+T[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 = map(str, 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,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()
list = []
for i in range(0,N):
    list.append(S[i])
    list.append(T[i])
print(*list, sep='')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

s = ''
for i in range(n):
  s = s + s1[i]
  s = s + s2[i]

print(s)

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())
ans = []
for i in range(n):
    news = s[i]
    newt = t[i]
    ans.append(news)
    ans.append(newt)
print(*ans,sep="")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
_, S, T = open(0).read().split()
print(''.join([s + t for s, t in zip(S, T)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

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