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

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

 
ans=''

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs = [(input()) for i in range(2)]

num_char = int(inputs[0])
char_list = list(map(str, inputs[1].split()))

S = char_list[0]
T = char_list[1]
new_str = ""

for i in range(0,num_char):
  str = (S + T)[i::num_char]
  new_str += str

print(new_str)

Submission status: Accepted

Solution code:
lens = int(input())
char1, char2 = input().split()
chars = []
for n in range(lens):
    chars.append(char1[n])
    chars.append(char2[n])

print(''.join(chars))

Submission status: Accepted

Solution code:
#a, b, c = map(int, input().split)
lens = int(input())
char1, char2 = input().split()
chars = []
for n in range(lens):
    chars.append(char1[n])
    chars.append(char2[n])

print(''.join(chars))

Submission status: Accepted

Solution code:
import sys

if sys.platform =='ios':
	sys.stdin=open('input_file.txt')
	
#+++++

#a,b = map(int, input().split())
n = int(input().strip())
s,t=input().split(' ')
a = ""
for i in range(n):
	a +=s[i]
	a+=t[i]
print(a)

Submission status: Accepted

Solution code:
from collections import deque
N = int(input())
n = input()    
m = n.split()
p = [i for i in m]
a = ""
for i in range(N):
    a = a + p[0][i] + p[1][i]
print(a)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(W)

Submission status: Accepted

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

Submission status: Accepted

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

result=""

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
s=list(map(str,input().split()))
s1=list(s[0])
s2=list(s[1])
l=[]
for i in range(a):
    l.append(s1[i])
    l.append(s2[i])
u=""
print(u.join(l))

Submission status: Accepted

Solution code:
import numpy as np
N = int(input())
S, T = list(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 = 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(" ")

a = ""
for i,j in zip(list(S),list(T)):
    a+=i+j
print(a)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(str,input().split()))
k=[]
for i in range(n):
    for j in range(2):
        k.append(a[j][i])
print(''.join(k))

Submission status: Accepted

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

Submission status: Accepted

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

s = []
t = []
for i in range(len(st)):
    if i == N:
        continue
    if i <= N:
        s.append(st[i])
    else:
        t.append(st[i])

ans = ""
for j in range(N):
    ans += s[j]+t[j]

print(ans)

Submission status: Accepted

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

str_a = ""

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

Submission status: Accepted

Solution code:
import sys
bbn=1000000007
	
#+++++
		
def main():
	n = int(input())
	ss = input()
	s=ss[:n]
	t=ss[n+1:]
	st=[cs+ct for cs,ct in zip(s,t)]
	ret=''.join(st)
	print(ret)
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

Solution code:
# abc148_b.py
from sys import stdin
N = int(stdin.readline().rstrip())
S, T = stdin.readline().rstrip().split()
A = ""
for i in range(N):
	A += S[i] + T[i]

print(A)

Submission status: Accepted

Solution code:
A =int(input())
B,C =map(str,input().split())

for i in range(A):
    print(B[i]+C[i],end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = input().split()
l = [x + y for x, y in zip(S, T)]
ans = ''
for i in l:
  ans += i
print(ans)

Submission status: Accepted

Solution code:
N = int(input())

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

#print(S)
#print(len(S))
#print(len(T))

moji = ""

if(len(S) == len(T) == N):
  for i in range(0, N):
    str = (S + T)[i::N]
    moji += str
print(moji)

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
S_list=[c  for c in S]
T_list=[c  for c in T]

answer_list=[]
mojiretu=""
for i in range(N):
    answer_list.append(S_list[i])
    answer_list.append(T_list[i])
for x in answer_list:
    mojiretu += x
    
print(mojiretu)

Submission status: Accepted

Solution code:
N=int(input())
S,T = input().split()
#print(list(S))
Sl = list(S)
Tl = list(T)
ans=[]

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)


def main():
    N = int(input())
    b, c = [str(i) for i in input().split()]

    ans = ""
    for i in range(N):
        ans += b[i]
        ans += c[i]
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
a,b=map(str, input().split())
ans=[]
for i in range(2*N):
    if i % 2 !=0:
        ans.append(b[i//2])
    else :
        ans.append(a[i//2])
print("".join(ans))

Submission status: Accepted

Solution code:
s = int(input())
str1, str2 = [s for s in input().split()]


ans=[]
for i in range(s):
  ans += str1[i]
  ans += str2[i]

  
print(''.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
a,b = 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 = 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=input()
ST=input()
S=ST.split(' ')[0]
T=ST.split(' ')[1]
result=''

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

Submission status: Accepted

Solution code:
N = int(input())

s,t = input().split()

r = ''
j = 0

for i in range(N):
    r += s[j]
    r += t[j]
    j += 1

print(r)

Submission status: Accepted

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

d = ""

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

print(d)

Submission status: Accepted

Solution code:
n = int(input())

s, t = input().split()

new = []

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

print(''.join(new))

Submission status: Accepted

Solution code:
N=int(input())
S,T=map(str,input().split())
lS=list(S)
lT=list(T)
lAns=[0]*2*N

for i in range(N):
	lAns[2*i]=lS[i]
	lAns[2*i+1]=lT[i]

Ans=''.join(lAns)
print(Ans)

Submission status: Accepted

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

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

print(A)

Submission status: Accepted

Solution code:
arr = ""
N = int(input())
string = input().split(" ")
for i in range(0,N): 
    arr += string[0][i] + string[1][i]
print(arr)

Submission status: Accepted

Solution code:
n = int(input())
input_str = input().split()
s = input_str[0]
t = input_str[1]
ans_st = s+t
ans_join = [ans_st[i]+ans_st[i+n] for i in range(n)]
ans = ''.join(ans_join)
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
length = int(input())
string = input()

s,t = string.split()
res = ""
for ele in range(length):
  res+= s[ele] + t[ele]
print(res)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = int(input())
ST= list(input())

S = [0 for i in range(N)]
T = [0 for i in range(N)]
for i in range(N):
    S[i] = ST[i]
for i in range(N):
    T[i] = ST[i+1+N]
newlist = [0 for i in range(2*N)]
i = 0
while i < N:
    newlist[i*2] = S[i]
    newlist[i*2+1] = T[i]
    i += 1
print("".join(newlist))

Submission status: Accepted

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

res = ''
for ss, tt in zip(s, t):
    res += ss + tt
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
c1, c2 = input().split()

temp = ''

for i in range(n):
  temp += c1[i] + c2[i]

print(temp)

Submission status: Accepted

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

newword = []
for num in range(len(S)):
    newword.append(S[num])
    newword.append(T[num])
word = ""
for i in newword:
    word+=i
print(word)

Submission status: Accepted

Solution code:
N=int(input())
s,t=(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 = map(str, input().split())
k = list(s)
l = list(t)
i = 0
a = []
while i < n:
   a += k[i] + l[i]
   i += 1

w = ''.join(a)
print(w)

Submission status: Accepted

Solution code:
n=int(input())

s,t=input().split()
c=''
i=0
j=0
f=0
for _ in range(len(s)+len(t)):
          if f==0:
             c+=s[i]
             i+=1
             f=1
          else:
              c+=t[j]
              j+=1
              f=0
print(c)

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

Submission status: Accepted

Solution code:
N = int(input())
S = input()
arr = [i for i in S.split(' ')]
arr1 = list(arr[0])
arr2 = list(arr[1])
result = []
for i in range(N):
	result.append(arr1[i])
	result.append(arr2[i])
str1 = ''.join(result)
print(str1)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
N = int(input())
s,t = (str(i) for i in input().split())
u=''
# 文字列の入力
for i in range(0,N,1):
    u+=s[i]+t[i]
# 出力
print(u)

Submission status: Accepted

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

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

SLIST = list(S)
TLIST = list(T)

STLIST = []

for i in range(2 * N):
  if i % 2 == 0:
    STLIST.append(SLIST[int(i / 2)])
  if i % 2 == 1:
    STLIST.append(TLIST[int(i // 2)])

ans = ''
for i in STLIST:
  ans += i

#print('N = ', N)
#print('S = ', S, ' T = ', T)
#print('SLIST = ', SLIST, ' TLIST = ', TLIST)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(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()
    res = solve(n, s, t)
    print(res)


def test():
    assert solve(2, "ip", "cc") == "icpc"
    assert solve(8, "hmhmnknk", "uuuuuuuu") == "humuhumunukunuku"
    assert solve(5, "aaaaa", "aaaaa") == "aaaaaaaaaa"


if __name__ == "__main__":
    test()
    main()

Submission status: Accepted

Solution code:
N = int(input())

S = input().split()
a = []
for i in range(N):
    for j in range(2):
        a.append(S[j][i])

print("".join(a))

Submission status: Accepted

Solution code:
input_num = int(input())
input_s, input_t = input().split(" ")

ans_str = ""
for i in range((input_num)):
    ans_str += input_s[i]
    ans_str += input_t[i]

print(ans_str)

Submission status: Accepted

Solution code:
def main():
  a = int(input())
  b = input()
  l = b.split()
  d = a * 2
  str1 = []
  s = "".join(i+j for i, j in zip(l[0],l[1]))
  print(s)
 
if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
str = input()
sl = list(str.split(" ")[0])
tl = list(str.split(" ")[1])

for i in range(0,int(n)):
    print(sl[i],end="")
    print(tl[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())
H = list(map(str, input().split()))
S = H[0]
T = H[1]
#print(S)
#print(T)
L=S[0]+T[0]
for i in range(1,N):
    L=L+S[i]
    L=L+T[i]
print(L)

Submission status: Accepted

Solution code:
a=int(input())
s=input().split()
ans =""
for i in range(a):
  for j in range(2):
    ans+=s[j][i]
print(ans)

Submission status: Accepted

Solution code:
from sys import stdin

N  = int(input())
S,T = stdin.readline().rstrip().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_.replace(',',''))

Submission status: Accepted

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

l = [[] for _ in range(2*n)]
for i in range(2*n):
    if i % 2==0:
        l[i]=s[i//2]
    else:
        l[i]=t[i//2]
answer = ''.join(l)
print("{}".format(answer))

Submission status: Accepted

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

ans = []
for i in range(0, int(n[0])):
  ans.append(s[i])
  ans.append(t[i])
  
print(''.join(map(str,ans)))

Submission status: Accepted

Solution code:
N=int(input())
s=list(input().split())
ans=str()
for i in range(N):
    ans+=s[0][i]+s[1][i]
print(ans)

Submission status: Accepted

Solution code:
N=int(input())
S,T=input().split()
ST=list()
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:
N = int(input())
S, T = [x for x in input().split()]
string = ""
for i in range(N):
    string += S[i]
    string += T[i]
print(string)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def bitlist(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res

#a = list(map(int, input().split()))

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

print(l)

Submission status: Accepted

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

def print_ans(N, S, T):
    """Test Case
    >>> print_ans(2, "ip", "cc")
    icpc
    >>> print_ans(8, "hmhmnknk", "uuuuuuuu")
    humuhumunukunuku
    >>> print_ans(5, "aaaaa", "aaaaa")
    aaaaaaaaaa
    """
    ans = []
    for i in range(N):
        ans.append(S[i])
        ans.append(T[i])
    print(''.join(ans))

if __name__ == '__main__':
    N = int(input().rstrip())
    S, T = input().rstrip().split()
    print_ans(N, S, T)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Slist = []
Tlist = []
result= []

for c in S:
    Slist.append(c)
for c in T:
    Tlist.append(c)

for i in list(range(N)):
    result.append(Slist[i])
    result.append(Tlist[i])

s = "".join(result)

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())						# 5
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) = list(map(str, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inputs = [input() for i in range(2)]

n = int(inputs[0])

def parse(str,num):
    s1 = str[0:num]
    s2 = str[num+1:2*num+1]
    return [s1,s2]

words = parse(inputs[1],n)

output = ''

for i in range(n+1):
    for j in words:
        output = output + j[i-1:i]

print(output)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC148 B

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

res = ""

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

print(res)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import itertools#これは色々使える組み込み関数みたいなやつ
import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
i=0
N=int(input())

#N, L=input().split()
#S=input()
#T=input()
#S_list=list(S)
ST_list=  list(input().split(" "))
S_list=list(ST_list[0])
T_list=list(ST_list[1])
#print(S_list)
#print(T_list)
sentence=""

for i in range(N):
 sentence=sentence+S_list[i]+T_list[i]

print(sentence)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

if len(S) == N and len(T) == N:
    for i in range(N):
        new_str += S[i]
        new_str += T[i]

print(new_str)

Submission status: Accepted

Solution code:
N = int(input())

moji = input().split()
S = moji[0]
T = moji[1]
num = 1

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

Submission status: Accepted

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

S_list = list(S)
T_list = list(T)
U_list = []
for i in range(N):
    U_list.append(S_list[i])
    U_list.append(T_list[i])

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

Submission status: Accepted

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

s3 = ""
cs1 = 0
cs2 = 0
for i in range(2 * len(s1)):
	if not i % 2:
		s3 += s1[cs1]
		cs1 += 1
	else:
		s3 += s2[cs2]
		cs2 += 1
print(s3)

Submission status: Accepted

Solution code:
length =int(input())

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

result = ""

list_s = list(s)
list_t = list(t)

for i in range(length):
  result = result + list_s[i]
  result = result + list_t[i]
  #result = result + s + list_t[i]
 
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
a = input().split()
b = list(a[0])
c = list(a[1])
ans = []
for i in range(N):
    ans.append(b[i])
    ans.append(c[i])
print(''.join(ans))

Submission status: Accepted

Solution code:
n = int(input())
s, t = tuple(map(list, 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())
li = input().split()
a=list(li[0])
b=list(li[1])
for i in range(n):
  print(a[i],end="")
  print(b[i],end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

length = int(input())
strings = input().split(' ')
s = strings[0].strip()
t = strings[1].strip()

st = ''
for i in range(length):
  st += s[i] + t[i]

print(st)

Submission status: Accepted

Solution code:
num = int(input())
str1, str2 = input().split()
marged = "";

if num >= 1 and num <= 100:
	if str1.islower() and str2.islower():
		for i in range(num):
			marged += str1[i]+str2[i]
		print(marged)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
value = input()
split = value.split(" ")
S = split[0]
T = split[1]
new_word = ""
for num in range(N):
    new_word += S[num] + T[num]
print(new_word)

Submission status: Accepted

Solution code:
len = int(input())

s = input().split(' ')

output = ""

for i in range(len):
  output += s[0][i] + s[1][i]
  
print(output)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
first, next = input().split();
complete = ""

for s, t in zip(first, next):
    complete += s + t

print(complete)

Submission status: Accepted

Solution code:
n = int(input())
st = str(input()).split(' ')
ans = ''
for i in range(n):
    ans += st[0][i]
    ans += st[1][i]
print(ans)

Submission status: Accepted

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

a = list(a)
b = list(b)
ans = []
for i in range(n):
  ans.append(a[i])
  ans.append(b[i])
print(''.join(ans))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

NNN = input()

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

S_list =list(S)
T_list =list(T)

N = len(S_list)
outstr = []

for n in range(N*2):
    if n%2 == 0:
        outstr.append(S_list[int(n / 2)])
    else:
        outstr.append(T_list[int(n / 2)])

STR = ','.join(outstr)
STR2 = STR.replace(",", "")
print(STR2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = int(input())

S,T = input().split()

New_string = ""

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

print(New_string)

Submission status: Accepted

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

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

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

for _ in range(num):
  u.append(s[_] + t[_])

ans = ''.join(u)

print(ans)

Submission status: Accepted

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

ST = []
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(0, 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]
    ans += T[i]

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print("".join(ans))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

s1 = list(s[0])
s2 = list(s[1])

for i in range(a):
  x += s1[i]+s2[i]
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
length = int(input())
words = input().split(" ")
pre = words[0]
suc = words[1]
pre1 = list(pre)
suc1 = list(suc)

word = []

for i in range(0,length):
  print(pre1[i], end="")
  print(suc1[i], end="")

Submission status: Accepted

Solution code:
# coding: utf-8

n = int(input())
st = list(map(str,input().split()))
s = list(st[0])
t = list(st[1])
ans=[]

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

print("".join(ans))

Submission status: Accepted

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

new = []

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(output)