Prefix and Suffix

AtCoder

IDagc006_a

Time2000ms

Memory256MB

Difficulty—

Snuke is interested in strings that satisfy the following conditions: * The length of the string is at least $N$. * The first $N$ characters equal to the string $s$. * The last $N$ characters equal to the string $t$. Find the length of the shortest string that satisfies the conditions. ## Constraints * $1≤N≤100$ * The lengths of $s$ and $t$ are both $N$. * $s$ and $t$ consist of lowercase English letters. ## Input The input is given from Standard Input in the following format: $N$ $s$ $t$ [samples]

Samples

Input #1

3
abc
cde

Output #1

5

The shortest string is `abcde`.

Input #2

1
a
z

Output #2

2

The shortest string is `az`.

Input #3

4
expr
expr

Output #3

4

The shortest string is `expr`.

API Response (JSON)

{
  "problem": {
    "name": "Prefix and Suffix",
    "description": {
      "content": "Snuke is interested in strings that satisfy the following conditions: *   The length of the string is at least $N$. *   The first $N$ characters equal to the string $s$. *   The last $N$ characters e",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "agc006_a"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Snuke is interested in strings that satisfy the following conditions:\n\n*   The length of the string is at least $N$.\n*   The first $N$ characters equal to the string $s$.\n*   The last $N$ characters e...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments