{"problem":{"name":"New Place","description":{"content":"You are given strings $S$ and $T$ of length $N$ consisting of lowercase English letters. You can repeat the following operation any number of times (possibly zero). *   Erase the **first** character ","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"arc154_b"},"statements":[{"statement_type":"Markdown","content":"You are given strings $S$ and $T$ of length $N$ consisting of lowercase English letters.\nYou can repeat the following operation any number of times (possibly zero).\n\n*   Erase the **first** character of $S$ and insert the same character at any position of $S$.\n\nDetermine whether it is possible to make $S$ equal $T$, and if it is possible, find the minimum number of operations needed.\n\n## Constraints\n\n*   $1 \\le N \\le 2 \\times 10^5$\n*   $S$ and $T$ are strings of length $N$ consisting of lowercase English letters.\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$N$\n$S$\n$T$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"arc154_b","tags":[],"sample_group":[["4\nabab\nabba","2\n\nYou can make $S$ equal $T$ in two operations, as follows.\n\n*   Erase the first character of $S$, and insert that character `a` at the end of $S$, making $S$ `baba`.\n*   Erase the first character of $S$, and insert that character `b` between the $2$\\-nd and $3$\\-rd characters of $S$, making $S$ `abba`.\n\nIt is impossible to make $S$ equal $T$ in one or fewer operations, so the answer is $2$."],["3\narc\ncra","2"]],"created_at":"2026-03-03 11:01:13"}}