#include<iostream>
#include<algorithm>
#include<cmath>
using namespace std;
int main()
{
	string s,t;
	int n;
	cin>>n>>s>>t;
	for(int i=n;i;i--)
	{
		int f=0;
		for(int j=0;j<i;j++)if(s[n-i+j]!=t[j])f=1;
		if(f==0)
		{
			cout<<n*2-i<<endl;
			return 0;
		}
	}
	cout<<2*n<<endl;
}
### Prompt

Develop a solution in cpp to the problem described below:

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<algorithm>
#include<cmath>
using namespace std;
int main()
{
	string s,t;
	int n;
	cin>>n>>s>>t;
	for(int i=n;i;i--)
	{
		int f=0;
		for(int j=0;j<i;j++)if(s[n-i+j]!=t[j])f=1;
		if(f==0)
		{
			cout<<n*2-i<<endl;
			return 0;
		}
	}
	cout<<2*n<<endl;
}
```