output_description: Print the string formed.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      S T
attempt: # -*- coding: utf-8 -*-
  
  import sys
  
  
  def input():
      return sys.stdin.readline().strip()
  
  
  def list2d(a, b, c):
      return [[c] * b for i in range(a)]
  
  
  def list3d(a, b, c, d):
      return [[[d] * c for j in range(b)] for i in range(a)]
  
  
  def list4d(a, b, c, d, e):
      return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
  
  
  def ceil(x, y=1):
      return int(-(-x // y))
  
  
  def INT():
      return int(input())
  
  
  def MAP():
      return map(int, input().split())
  
  
  def LIST(N=None):
      return list(MAP()) if N is None else [INT() for i in range(N)]
  
  
  def Yes():
      print("Yes")
  
  
  def No():
      print("No")
  
  
  def YES():
      print("YES")
  
  
  def NO():
      print("NO")
  
  
  sys.setrecursionlimit(10**9)
  INF = 10**18
  MOD = 10**9 + 7
  
  N = INT()
  S, T = input().split()
  S = list(S)
  T = list(T)
  
  ans = []
  for i in range(N):
      ans.append(S[i])
      ans.append(T[i])
  print("".join(ans))
  
problem_description: 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.
samples: [{"input": "2\n    ip cc", "output": "icpc\n    \n\n* * *"}, {"input": "8\n    hmhmnknk uuuuuuuu", "output": "humuhumunukunuku\n    \n\n* * *"}, {"input": "5\n    aaaaa aaaaa", "output": "aaaaaaaaaa"}]