Strings with the Same Length

AtCoder

IDabc148_b

Time2000ms

Memory256MB

Difficulty—

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$ [samples]

Samples

Input #1

2
ip cc

Output #1

icpc

Input #2

8
hmhmnknk uuuuuuuu

Output #2

humuhumunukunuku

Input #3

5
aaaaa aaaaa

Output #3

aaaaaaaaaa

API Response (JSON)

{
  "problem": {
    "name": "Strings with the Same Length",
    "description": {
      "content": "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",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc148_b"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Given are strings $s$ and $t$ of length $N$ each, both consisting of lowercase English letters.\nLet us form a new string by alternating the characters of $S$ and the characters of $T$, as follows: the...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments