Problem:


Score : 200 points

Problem Statement

Given are strings s and t of length N each, both consisting of lowercase English letters.

Let us form a new string by alternating the characters of S and the characters of T, as follows: the first character of S, the first character of T, the second character of S, the second character of T, ..., the N-th character of S, the N-th character of T. Print this new string.

Constraints

1 \leq N \leq 100

|S| = |T| = N

S and T are strings consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S T

Output

Print the string formed.

Sample Input 1

2
ip cc

Sample Output 1

icpc

Sample Input 2

8
hmhmnknk uuuuuuuu

Sample Output 2

humuhumunukunuku

Sample Input 3

5
aaaaa aaaaa

Sample Output 3

aaaaaaaaaa



Sample input:
2
ip cc


Sample output:
icpc

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split()))  # applies to only numbers
rs = lambda: stdin.readline().rstrip()  # ignores trailing space

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

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

print(answer)

Submission status: Accepted

Solution code:
# @Author: Amit Dwivedi
# @Date:   2019-12-22 11:55:43
# @Last Modified by:   Amit Dwivedi
# @Last Modified time: 2019-12-22 12:04:16
ll= lambda : list(map(int,input().split()))
testcases=1
# testcases=int(input())
for testcase in range(testcases):
	[n] = ll()
	s,t = input().split()
	for i in range(n):
		print(s[i],t[i],sep = "",end = "")

Submission status: Accepted

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

ans = ""
for val  in range(n):
    ans = ans + s1[val] + s2[val]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
S, T = raw_input().split()
print "".join(sum(map(list, zip(S, T)), []))

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

print(ans)

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 = 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 = (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())
a,b=map(str,input().split())
c=list(a)
d=list(b)
e=[]
for i in range(n):
  e.append(c[i])
  e.append(d[i])
print(''.join(e))

Submission status: Accepted

Solution code:
import sys

#read = sys.stdin.buffer.read
#input = sys.stdin.buffer.readline
#inputs = sys.stdin.buffer.readlines


# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
#import numpy as np

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




	
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]
  ans = ans + T[i]

print(ans)

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    ans = ""
    for i in range(N):
        ans += S[i]
        ans += 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:
# coding: utf-8
n = int(input())
s, t = map(str, input().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

res = ''

for (i, s) in enumerate(S):
    res += s
    res += T[i]

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

Submission status: Accepted

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

print(word)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())
sl=input().split(" ")

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
a = [None]*(2*n)
for i in range(n):
    a[i*2] = s[i]
    a[i*2+1] = t[i]
print(''.join(a))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

li = []

for i in range(n):
    li.append(st[0][i])
    li.append(st[1][i])
    
print(*li,sep='')

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
n = int(input())

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

r = ""

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

print(r)

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()
S, T = S_MAP()
b = []
for i in range(N):
  a = S[i] + T[i]
  b.append(a)
b = "".join(b)
print(b)

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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 = [i for i in input().split()]
ans = ""
for i in range(len(s[0])):
  ans += s[0][i]
  ans += s[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:
def run():
  N = int(input())
  S, T = input().split()
  ans = ''
  for s, t in zip(list(S), list(T)):
    ans += s+t
  print(ans)
  
if __name__ == '__main__':
  run()

Submission status: Accepted

Solution code:
N = int(input())
s,t = input().split()
answer = ''
for num in range(N):
    answer += s[num]
    answer += t[num]
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input().strip())

s, t = map(str, 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 = int(input())
S, T = map(str, 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 = map(str, input().split())

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

print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

N = inp()
S,T = input().split()
print(''.join([s+t for s,t in zip(S,T)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
A, B = input().split()
for i in range(0,N):
  print(A[i]+B[i],end='')

Submission status: Accepted

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

ans = ""
for ss, tt in zip(s,t):
  ans = ans+ss+tt

print(ans)

Submission status: Accepted

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

def solve(N, S, T):
    U = ['*'] * (N * 2)
    for i in range(N):
        U[i*2] = S[i]
        U[i*2+1] = T[i]
    return ''.join(U)


if __name__ == '__main__':
    inputs = read()
    print("%s" % solve(*inputs))

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:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

N = INT()
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:
# -*- coding: utf-8 -*-
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 = [x for x in input().split()]
for i in range(N):
  print(S[i], end='')
  print(T[i], end='')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print('')

Submission status: Accepted

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

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

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

r = ""

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

print(r)

Submission status: Accepted

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

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

Submission status: Accepted

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

res = ''
for i in range(n):
    res += st[0][i]
    res += st[1][i]

print(res)

Submission status: Accepted

Solution code:
n = int(input())

s, t = input().split()


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


print(ans)

Submission status: Accepted

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

ans = ''

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

print(''.join([''.join([S[i], T[i]]) for i in range(N)]))

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())
ss = input().split()
print("".join([ss[0][i] + ss[1][i] for i in range(n)]))

Submission status: Accepted

Solution code:
input_line = int(input())
l = input().rstrip().split(' ')
s = l[0]
t = l[1]

ans = ""

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

out = ""
for i in range(n):
    out += txts[0][i] + txts[1][i]

print(out)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

result = []
for s, t in zip(S, T):
    result.append(s)
    result.append(t)
    
print(''.join(result))

Submission status: Accepted

Solution code:
# 2019/12/22

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

Submission status: Accepted

Solution code:
n = int(input())
s,t = input().split()
#print(s)
#print(t)
target = ''
for si,ti in zip(s,t):
    target += si
    target += ti
print(target)

Submission status: Accepted

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

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

n = int(stdin.readline().rstrip())
a,b = [x for x in stdin.readline().rstrip().split()]
ns = ""
for i in range(n):
    ns += a[i]
    ns += b[i]
print(ns)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

mojiretsu = input()
S, T = mojiretsu.split(" ")

newmojiretsu = []

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

print("".join(newmojiretsu))

Submission status: Accepted

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

ans = [""]*(N*2)
id = 0
for i in range(2*N):
    if i % 2 == 0:
        ans[i] = S[id]
    else:
        ans[i] = T[id]
        id += 1
print("".join(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 = map(str,input().split())
ans=''
for s,t in zip(S,T):
    ans += s+t
print(ans)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    n =INT()
    a,c =LISTS()
    b = []
    for i in range(n):
        b.append(a[i])
        b.append(c[i])
    print(*b, sep='')
if __name__ == '__main__':
    do()

Submission status: Accepted

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

mylist = [1,2,3]

myans = ''

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

Submission status: Accepted

Solution code:
n = int(input())

a = input().split()

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def solve():
    input()
    return ''.join(map(''.join, zip(*input().split()),))

if __name__ == '__main__':
    print(solve())

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
len_str = int(input())

input_1, input_2 = input().split()

ans = ""
for i in range(0, len_str):
    ans = ans + input_1[i] + input_2[i]

print(ans)
exit(0)

Submission status: Accepted

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

print(''.join(d))

Submission status: Accepted

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

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

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

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

for s in ST:
    print(s, end = '')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():
    N = I()
    S,T = sys.stdin.readline()[:-1].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())
inf = input().split()
s = inf[0]
t = inf[1]
ans = ''
for i in range(2*N):
  if i%2==0:
    j = i//2
    ans += s[j]
  else:
    j = (i-1)//2
    ans += t[j]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = "".join([x+y for x,y in zip(S,T)])
print(ans)

Submission status: Accepted

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

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

print()

Submission status: Accepted

Solution code:
n = int(input())
a, b = input().split()
for i in range(n):
    print(a[i], b[i], sep = '', 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])
  
print(''.join(map(str, 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
n = int(sys.stdin.readline())
S, T = sys.stdin.readline().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 s, t in zip(S, T):
    ans.append(s)
    ans.append(t)

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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:
def samelen(s):
    s1, s2 = s[1].split()
    ans = ""
    for i, j in zip(s1, s2):
        ans += i + j
    print(ans)

if __name__ == "__main__":
    import sys
    in_str = []
    for line in sys.stdin:
        in_str.append(line)
    samelen(in_str)

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

Submission status: Accepted

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n = int(input())
s, t = map(str, input().split())
ans = []

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

print(''.join(ans))

Submission status: Accepted

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

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

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

print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Ans = list()
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()

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

Submission status: Accepted

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

Submission status: Accepted

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


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








    
    


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = I()
a,b = Ss()
for e in [a[i]+b[i] for i in range(N)]:
    print(e,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:
if __name__ == "__main__":
	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 = map(list , input().split())
for i in range(N):
    print(S[i],end = "")
    print(T[i], end="")

Submission status: Accepted

Solution code:
n = int(input())
s, t = map(str, input().split())
ans = ""
for _s, _t in zip(s, t):
    ans += _s+_t
print(ans)

Submission status: Accepted

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

ss = ''

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

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

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

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

N = I()
x = str(input())

S = x[:N]
T = x[N+1:]
c = str()
for i in range(N):
    c += S[i]
    c += T[i]

print(c)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

print("".join(s+t for s, t in zip(S, T)))

Submission status: Accepted

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

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

print(li)

Submission status: Accepted

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

Submission status: Accepted

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

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

print()

Submission status: Accepted

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

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

print("".join(ret))

Submission status: Accepted

Solution code:
n = int(input())
a, b = input().split()
c = ''
for x, y in zip(a, b):
	c += x + y
print(c)

Submission status: Accepted

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

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

print(ans)