#include<bits/stdc++.h>
using namespace std;
int n;string p,s;
int main()
{
	cin>>n>>p>>s;int ls=0;
	for(int i=1;i<=n;i++) 
	{
		if(p.substr(n-i)==s.substr(0,i))
			ls=max(ls,i);
	}
	cout<<n*2-ls;
	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 n;string p,s;
int main()
{
	cin>>n>>p>>s;int ls=0;
	for(int i=1;i<=n;i++) 
	{
		if(p.substr(n-i)==s.substr(0,i))
			ls=max(ls,i);
	}
	cout<<n*2-ls;
	return 0;
}
```