#include <bits/stdc++.h>
using namespace std;
int main(){
	string s, t;
	int N;
	cin>>N>>s>>t;
	int j = 0;
	// while(t[i] == s[N-1-i] && i < N)
	// 	i++;
	for(j = 0; s.substr(j) != t.substr(0, N-j) && j < N; j++){

	}
	cout<<N+j;

	return 0;
}
### Prompt

Construct a Cpp code solution to the problem outlined:

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 <bits/stdc++.h>
using namespace std;
int main(){
	string s, t;
	int N;
	cin>>N>>s>>t;
	int j = 0;
	// while(t[i] == s[N-1-i] && i < N)
	// 	i++;
	for(j = 0; s.substr(j) != t.substr(0, N-j) && j < N; j++){

	}
	cout<<N+j;

	return 0;
}
```