Problem:


Score : 200 points

Problem Statement

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

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

Constraints

1 \leq N \leq 100

|S| = |T| = N

S and T are strings consisting of lowercase English letters.

Input

Input is given from Standard Input in the following format:

N
S T

Output

Print the string formed.

Sample Input 1

2
ip cc

Sample Output 1

icpc

Sample Input 2

8
hmhmnknk uuuuuuuu

Sample Output 2

humuhumunukunuku

Sample Input 3

5
aaaaa aaaaa

Sample Output 3

aaaaaaaaaa



Sample input:
2
ip cc


Sample output:
icpc

Submission status: Accepted

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

for i,j in zip(S,T):
  print(i,end="")
  print(j,end="")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    length = int(input())
    data = input().split()
    print("".join([x+y for x,y in zip(*data)]))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
num = int(input())
ans=""
(s1,s2) = input().split(" ")



for i in range(num):
    ans+=s1[i]
    ans+=s2[i]

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

ans = ''
i = 0
while i < N:
    ans += S[i]
    ans += T[i]
    i += 1
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(raw_input())
S,T = raw_input().split()
ans = ""
for i in range(0,N):
  ans+=S[i]
  ans+=T[i]
print ans

Submission status: Accepted

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

ns = []
for a, b in zip(s, t):
    ns.extend([a, b])

print(''.join(ns))

Submission status: Accepted

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

Submission status: Accepted

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

ans = ""

for i,j in zip(s,t):
    ans += i
    ans += j
    
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=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()

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()
New = ""
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]
  ans +=t[i]
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意


n = int(input())
#ans = "".join([i+j for i,j in zip(input().split())])
c,d = [i for i in input().split()]
ans = "".join([i+j for i,j in zip(c,d)])



print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N=int(input())

S,T=map(str, input().split())
s=list(S)
t=list(T)

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

Submission status: Accepted

Solution code:
def MAP(): return list(map(int,input().split()))
def INT(): return int(input())
def FLOAT(): return float(input())
MOD = 10**9+7

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

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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

# code here
n = int(input().strip())
s, t = input().strip().split()

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

print("".join(d))

Submission status: Accepted

Solution code:
import sys

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

n = ni()
(s,t) = ns().split(" ")

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

print("".join(ret))

Submission status: Accepted

Solution code:
n=int(input())

a,b=input().split()
n=0
for i in a:
	print(a[n],end='')
	print(b[n],end='')
	n+=1
print()

Submission status: Accepted

Solution code:
n=int(input())

a,b=input().split()
a=a[:n]
b=b[:n]
n=0
for i in a:
	print(a[n],end='')
	print(b[n],end='')
	n+=1
print()

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(1000000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in sys.stdin.readline().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v

def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

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

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

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

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False

# --------------------------------------------

dp = None


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

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
str1,str2 = input().split()
str3 = ""

for i in range(0,n):
  str = (str1 + str2)[i::n]
  str3 += str

print(str3)

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


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = int(input())
s,t = map(str,input().split())

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
_,s=open(0)
print(''.join(sum(zip(*s.split()),())))

Submission status: Accepted

Solution code:
n = int(input())
s, t = [ str(_) for _ 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 = list(map(str, input().split()))
c = []
ans = ''

for i in range(n):
  c.append(a[i])
  c.append(b[i])

for i in c:
  ans += i
  
print(ans)

Submission status: Accepted

Solution code:
import math as m
from array import *
import sys
import datetime
import calendar

n= int(input())

s = input()
l1= s.split(" ")
s1=l1[0]
s2=l1[1]
for i in range(0,n):
    print(s1[i],end="")
    print(s2[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())
a = input().split()
b = list(a[0])
c = list(a[1])

list = []
for i in range(n):
    list.append(b[i])
    list.append(c[i])

mojiretu = list[0]
for i in range(1, len(list)):
    mojiretu += list[i]
print(mojiretu)

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

n = int(stdin.readline().rstrip())
s,t = stdin.readline().rstrip().split()


strng = ''
for i in range(n):
    strng += list(s)[i]
    strng += list(t)[i]


print(strng)

Submission status: Accepted

Solution code:
n = int(input())
a, b = input().split()
ans = str()
for i in range(n):
    ans += a[i] + b[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:
N=int(input())
S,T=map(str, input().split())
result=[]

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

print("".join(result))

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

print(F)

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:
input()
S, T = input().split()

for a, b in zip(S, T):
    print(a + b, end='')

Submission status: Accepted

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

output = '' 

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

print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
le = int(raw_input())
ip = raw_input().split(' ')
s1 = list(ip[0])
s2 = ip[1]
j = 1
for i in range(0,le):
  s1.insert(i+j,s2[i])
  j = j+1
print ''.join(s1)

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(n):
    print('{}{}'.format(s[i], t[i]), end='')

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().split()
print(''.join(''.join(x) for x in zip(S, T)))

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] + T[i]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
s=input()
a=s[:n]
b=s[n+1:]
#print(a,b)
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()
ans = [S[i // 2] if i % 2 == 0 else T[i // 2] for i in range(N * 2)]
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(message)

Submission status: Accepted

Solution code:

n = int(input())
s,t = input().split()
s = str(s.lower())
t = str(t.lower())
if len(s) == n and len(t) == n:
    new_list = []
    for item in range(len(s)):
        new_list.append(s[item])
        new_list.append(t[item])

    print(''.join(new_list))
else:
    pass

Submission status: Accepted

Solution code:
_,s=open(0)
j=''.join
print(j(map(j,zip(*s.split()))))

Submission status: Accepted

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

ans = ''
for x,y in zip(a,b):
    ans += x + y
    
print(ans)

Submission status: Accepted

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

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

U = ''.join(U)
print(U)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
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=int(input())
S,T=map(str,input().split())
list=[]
ans=''

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

Submission status: Accepted

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


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


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:
len = int(input())
strList = raw_input().split()
s = strList[0]
t = strList[1]
resultStr = ""
for i in range(len):
    resultStr += s[i] + t[i]
print(resultStr)

Submission status: Accepted

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

for i in range(n):
  c = c+A[i]
  c = c+B[i]

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

x = int(input())
a,b = map(str,input().split())
n = ""

for i in range(0,x):
    n = n + a[i] + b[i]

print(n)

Submission status: Accepted

Solution code:
N = int(input())

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

U=[]
for x in range(N) :
  U.append(S[x]+T[x])
result = ''.join(U)
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

print(strx)

Submission status: Accepted

Solution code:
N = int(input())
S, T = list(input().split())
S = list(S)
T = list(T)
j = 0
for i in range(0,N+N,2):
    S.insert(i+1,T[j])
    j +=1
print("".join(S))

Submission status: Accepted

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

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

print(o)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input_num = int(input())
input_str = input().split(" ")
input_s = input_str[0]
input_t = input_str[1]

for num in range(input_num):
    print(input_s[num] + input_t[num], end = "")

Submission status: Accepted

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

ret = ''
for i,j in zip(S, T):
    ret = ret + i + j
print(ret)

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())
words = input()
word = words.split(' ')
new_word = []

for i in range(2 * N):
    if i % 2 == 0:
        new_word.append(word[0][i//2])
    else:
        new_word.append(word[1][i//2])
    
print("".join(new_word))

Submission status: Accepted

Solution code:
N = int(input())
Slist = input().split()
A = Slist[0]
B = Slist[1]

for i in range (N):
	print(A[i],B[i], end='',sep='')

Submission status: Accepted

Solution code:
n = int(input())
a,b = input().split()
ans = ""
idx = 0
for i in a:
  ans += a[idx]
  ans += b[idx]
  idx +=1

print (ans)

Submission status: Accepted

Solution code:
x = input()
str1,str2=input().split()
s = "".join(i+j for i, j in zip(str1, str2))
print(s)

Submission status: Accepted

Solution code:
N = int(input())
s = input().split()
S = s[0]
T = s[1]
wordlist = []
for i in range(N):
    word = S[i]+T[i]
    wordlist.append(word)
mojiretu = ''.join(wordlist)
print(mojiretu)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
new_str, num, string = "", int(input()), input().split(" ")
for x in range(0, num):
    new_str += string[0][x] + string[1][x]
print(new_str)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
S = input().split()
A = S[0]
B = S[1]
ans = ""

for i in range(N):
  ans = ans + A[i]
  ans = ans + B[i]
  
print(ans)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import os
N= int(input())
nyu = input().split()
S=nyu[0].strip()
T=nyu[1].strip()
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()
strings=[]
for i in range(int(N)):
    strings.append(S[i]+T[i])
print(''.join(strings))

Submission status: Accepted

Solution code:
N = int(input())
str = input()
str = str.split()
str1 = str[0]
str2 = str[1]

ans = ''
for i in range(0, N):
  ans += str1[i] + str2[i]
print(ans)

Submission status: Accepted

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

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

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:
new_str, num, string= "",int(input()), input().split(" ")
for x in range (0,num):
  	new_str += string[0][x] + string[1][x]
print(new_str)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x = "".join(i+j for i, j in zip(s, t))

print(x)

Submission status: Accepted

Solution code:
a = int(raw_input())	
strings = raw_input().split(" ")
s0 = strings[0]
s1 = strings[1]
r = ""
t = 0
for i in range(len(s0)*2):
  if i % 2 == 0:
  	r += s0[t]
  else:
    r += s1[t]
    t += 1


print(r)

Submission status: Accepted

Solution code:
new_str = ""
num = int(input())
string = input().split(" ")
for x in range(0, num):
    new_str += string[0][x] + string[1][x]
print(new_str)

Submission status: Accepted

Solution code:
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

def debug(*var):
    print(*var, file=sys.stderr)

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
# from math import gcd
# from collections import defaultdict as dd, Counter
# from bisect import bisect_left as bl, bisect_right as br

n, = I()
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()

out_str = ''

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

print(out_str)

Submission status: Accepted

Solution code:
input();print(''.join(sum(zip(*input().split()),())))

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    S, T = map(str, 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()
A=""
for i in range(n):
    A += S[i] + T[i]

print(A)

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
input();print(''.join(a+b for a,b in zip(*input().split())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
l = int(input())
a = input().split()
s = ""

for i in range(0,2*l):
  if i % 2 == 0:
    s += a[0][int(i/2)]
  elif i % 2 == 1:
    s += a[1][int(i/2)]

print(s)

Submission status: Accepted

Solution code:

def main():
    N = int(input())
    S,T = input().split()
    new_str = []
    for _,(s,t) in enumerate(zip(S,T)):
        new_str.append(s)
        new_str.append(t)
        
    for i in range(len(new_str)):
        print(new_str[i],end='')
        if i == len(S)+len(T)-1:
            print()

if __name__=='__main__':
    main()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

N = int(readline())
S,T = read().decode('utf-8').rstrip().split()

A = [None] * (N+N)
A[::2] = S
A[1::2] = T

answer = ''.join(A)
print(answer)

Submission status: Accepted

Solution code:
input();a=""
for x,y in zip(*input().split()):a+=x+y
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

li_s = list(S)
li_t = list(T)

word = []
for (a,b) in zip(li_s,li_t):
  adds = a+b
  word+=adds

print(''.join(word))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
st  = input()

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

new_string = ''

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

Submission status: Accepted

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


def solve(N: int, S: str, T: str):
    
    ans = ''
    for s, t in zip(list(S),list(T)):
        ans += s + t
    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:
_ = input()
S, T = input().split()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count_for = int(input())
A = input().split(" ")
B = list(A[0])
C = list(A[1])
X = []
count = 0
for i in range(count_for):
	X.append(B[count])
	X.append(C[count])
	count += 1
print(str("".join(X)))

Submission status: Accepted

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

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

ST = ''

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

print(ST)

Submission status: Accepted

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

    return N, S, T


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


if __name__ == '__main__':
    N, S, T = read()
    print("%s" % solve(N, S, T))

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

ans=str('')

for n in range(N):
    ans=ans+(ST[0][n])
    ans=ans+(ST[1][n])

print(ans)

Submission status: Accepted

Solution code:
raw_input1 = input()
raw_input2 = input()

l = raw_input2.split()
N = int(raw_input1)
S =list(l[0])
T = list(l[1])


for i in range(N):
        T.insert(i*2, S[i])

ans = ''.join(T)

print(ans)

Submission status: Accepted

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

ans = ""

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

print(ans)