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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

n = onem()

a,b = input().split()

ccc = ""

for i in range(n*2):
    if i % 2 == 0:
        ccc += a[i//2]
    else:
        ccc += b[i//2]
print(ccc)

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:
#!/usr/bin/env python3
n = int(input().split()[0])
s, t = list(input().split())

ans = ""
for c1, c2 in zip(s, t):
    ans = ans + c1 + c2

print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a,b=map(str,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()
for i in range(N):
    print(S[i]+T[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:
def main():
    N = int(input())
    A = list(map(str, input().split()))
    i = 0
    while True:
        if i == N:
            break
        print(A[0][i],end='')
        print(A[1][i],end='')
        i += 1

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

word = ''
for a, b in zip(s, t):
  word += a + b
  
print(word)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
N = int(stdin.readline().rstrip())
S,T = [(x) for x in stdin.readline().rstrip().split()]
ans = ""
for i,j in zip(S,T):
    ans += (i + j)
print(ans)

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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 = list(input().split())
ans = ''
for s, t in zip(S, T):
    ans += s
    ans += t
print(ans)

Submission status: Accepted

Solution code:
num = int(input())
s1,s2 = map(str,input().split())
l = ""
for i in range(0,num):
    l+=s1[i]
    l+=s2[i]

print(l)

Submission status: Accepted

Solution code:
n = int(input())
s = input()
ss = s.split()
a = list(ss[0])
b = list(ss[1])

for i in range(n):
  print(a[i], end="")
  print(b[i], end="")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
write = sys.stdout.write
def ii(): return int(readline())
def mi(): return map(int, readline().rstrip().split())
def li(): return list(readline().rstrip())
def lmi(): return list(map(int, readline().rstrip().split()))
def end(*arg): print(*arg); sys.exit()
# template


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

Solution code:
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): #最大公約数
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def divisors(a): # 約数列挙
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): #素数判定
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): #素数列挙
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

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

if __name__=='__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

N = I()
S, T = input().split(" ")

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

print()

Submission status: Accepted

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

ST = "".join([s + t for s, t in zip(S, T)])

print(ST)

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().strip().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()
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 s, t in zip(S, T):
    ans = ans + s + t

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

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

print(n_str)

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())
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())
a,b = input().split()
s = ["0"]*n*2
s[::2] = a
s[1::2] = b
print(''.join(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 = 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().rstrip().split(' ')

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

print(''.join(chars))

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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


def main():
    N = int(input())
    S, T = map(str, input().split())
    ans = ""
    for c, d in zip(S, T):
        ans += c
        ans += d
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = int(input())
A, B = list(list(input().split()))
ans = ""
for a, b in zip(A, B):
    ans += a + b
print(ans)

Submission status: Accepted

Solution code:
import sys, math
def input():
    return sys.stdin.readline()[:-1]
from itertools import permutations, combinations
from collections import defaultdict

sys.setrecursionlimit(10**7)
N = int(input())
S, T = input().split()

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

print(l)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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()
res = ""
for i in range(n):
    res += s[i] + t[i]
print(res)

Submission status: Accepted

Solution code:
def main():
    n = int(input())
    s, t = input().split()
    res = []
    for i in range(n):
        res.append(s[i])
        res.append(t[i])
    return "".join(res)


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


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


def main():
    n = int(input())
    s, t = input().split()
    r = merge(n, s, t)
    print(r)


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 = 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())
tmp = input().split()
S = tmp[0]
T = tmp[1]

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


print(ans)

Submission status: Accepted

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

result = ""

for i in range(0, n):
    result += st[0][i] + st[1][i]

print(result)

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

ans = ''
for c1,c2 in zip(s1,s2):
  ans += c1 + c2

print(ans)

Submission status: Accepted

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


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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=int(input())
lst=input().split()
S=lst[0]
T=lst[1]
for i in range(2*N):
    if i%2==0:
        print(S[int(i/2)],end="")
    else:
        print(T[int(i/2)],end="")
print()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# N= int(input())
# N, K = [int(_) for _ in input().split()]

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

Submission status: Accepted

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

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

for i in v:
    print(i, end='')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = ''
for i in range(n):
    ans += a[0][i]+a[1][i]

print(ans)

Submission status: Accepted

Solution code:
import queue
import math
import copy
"""
N = int(input())
#S = input()
# (N,M) = (int(i) for i in input().split(" "))
# A = [int(i) for i in input().split()]
A = []
for i in range(N):
	A.append(int(input()))

print(A)

"""
N = int(input())
S = input().split()
print("".join([S[0][i]+S[1][i]for i in range(N)]))

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:
a = int(input())
s1, s2 = map(str, input().split())
s = ""
for i in range(a*2):
  if(i%2 == 0):
    s+=s1[int(i/2)]
  else:
    s+=s2[int(i/2)]
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

print(A)

Submission status: Accepted

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

Submission status: Accepted

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

ans=""

for i in range(n):
    ans+=lsa[i]+lsb[i]

print(ans)

Submission status: Accepted

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


def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def main():
    N = int(input())
    S, T = input().split()
    
    res = ""
    for s, t in zip(S, T):
        res += s + t
    
    print(res)


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys

def solve():
    N = int(input())
    S, T = map(str, input().split())
    Ans = [None] * (2 * N)
    for i in range(N):
        Ans[2 * i] = S[i]
        Ans[2 * i + 1] = T[i]
    print("".join(map(str, Ans)))
    
    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
def main():
    N = int(input())
    S, T = input().split(' ')
    a = ''
    for i, j in zip(S, T):
        a += i + j
    print(a)
main()

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

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
ls=['' for _ in range(2*N)]
for i in range(N):
  ls[2*i]=S[i]
  ls[2*i+1]=T[i]
print(*ls,sep='')

Submission status: Accepted

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

ans = ""

for i in range(len(a)):
    ans += a[i]
    ans += b[i]

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
for si, ti in zip(s, t):
    print(si, ti, sep='', 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 = input().strip().split(' ')
ans = []
for i, j in zip(s, t):
    ans += i
    ans += j
print(''.join(ans))

Submission status: Accepted

Solution code:
# coding: utf-8
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+=s[i]+t[i]
print(ans)

Submission status: Accepted

Solution code:
n = int(input())
s, t = input().split()
ans = []
for a in range(len(s) + len(t)):
    if a%2==0:
        ans.append(s[a//2])
    else:
        ans.append(t[a//2])
print("".join(ans))

Submission status: Accepted

Solution code:
N = int(input())
S, T = map(str, 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()
for i in range(2*N):
  if i%2==0:
    print(S[i//2],end="")
  else:
    print(T[i//2],end="")
print()

Submission status: Accepted

Solution code:
n = input()
s, t = raw_input().split()
l = []
for i in xrange(n):
    l.append(s[i])
    l.append(t[i])
print ''.join(l)

Submission status: Accepted

Solution code:
import sys
def input():
    return sys.stdin.readline()[:-1]
N = int(input())
S,T = map(str,input().split(' '))
ans = []
for i in range(N):
    ans.append(S[i]+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())
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())

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

print(''.join(answer))

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

print("")

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
s, t = input().split()
res = ""
for i in range(N):
  res += s[i] + t[i]
print(res)

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
N = int(input())
S, T = input().strip().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 = [i for i in 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)
l=[]
for i,j in zip(s,t):
  l.append(i+j)
  
print(''.join(l))

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline

n = int(input())
s,b = list(input().split())
ret = ""
for i in range(n):
    ret += s[i]
    ret += b[i]
print(ret)

Submission status: Accepted

Solution code:
import sys
n = int(input())
s, t = [i for i in sys.stdin.readline().split()]
res = ""
for _s, _t in zip(s, t):
    res += _s + _t
print(res)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

print("".join(c for st in zip(S, T) for c in st))

Submission status: Accepted

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

s = list(s)
t = list(t)
ans = []

for ss,tt in zip(s, t):
    ans.append(ss)
    ans.append(tt)

print("".join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def inpl():
    return list(map(int, input().split()))


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

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

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

Submission status: Accepted

Solution code:

#ライブラリインポート
from collections import defaultdict

#入力受け取り
def getlist():
	return list(map(int, input().split()))

#処理内容
def main():
	N = int(input())
	S, T = list(input().split())
	ans = ""
	for i in range(N):
		ans += S[i] + T[i]
	print(ans)


if __name__ == '__main__':
	main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import copy
import heapq
import math

def j(n):
    if n:print("Yes")
    else:print("No")
    exit(0)
rem = 10 ** 9 + 7

"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def ipmultiplerow(n):
    a = []
    for i in range(n):
        a.append(ip())
    return a
def printrow(a):
    for i in a:
        print(i)

n = ip()
a =input().split()
f = []
for i in range(n):
    f.append(a[0][i])
    f.append(a[1][i])
print(''.join(f))

Submission status: Accepted

Solution code:
#B
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:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    n=int(input())
    S,T=input().split()
    ans=[None]*(2*n)

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

    print(''.join(ans))
resolve()

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
    ans = []
    for i in range(n * 2):
        if i % 2 == 0:
            ans.append(s[i//2])
        else:
            ans.append(t[i//2])
    print("".join(ans))


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

    print(new)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
N = int(input())
S, T = [x for x in input().strip().split()]
ans = ''
for s, t in zip(S, T):
    ans += s + t
print(ans)