#include <iostream>
#include <cmath>
using namespace std;
 
int main() {
	int i,n;
	string sa,sb;
	cin >> n >> sa >> sb;
	for(i = n;i > 0;i--){
		int pos = (int)sa.rfind(sb.substr(0,i));
		if(pos == n - i) break;
	}
	cout << n * 2 - i << endl;
	return 0;
}
### Prompt

Generate a cpp solution to the following problem:

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


Output

Print the length of the shortest string that satisfies the conditions.

Examples

Input

3
abc
cde


Output

5


Input

1
a
z


Output

2


Input

4
expr
expr


Output

4

### Response

```cpp
#include <iostream>
#include <cmath>
using namespace std;
 
int main() {
	int i,n;
	string sa,sb;
	cin >> n >> sa >> sb;
	for(i = n;i > 0;i--){
		int pos = (int)sa.rfind(sb.substr(0,i));
		if(pos == n - i) break;
	}
	cout << n * 2 - i << endl;
	return 0;
}
```