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

Please create a solution in CPP 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>
using namespace std;
bool b;
int n,A;
string s,t;
int main()
{
	cin>>n>>s>>t;
	for(int i=1;i<=n;i++)
	{
		b=true;
		for(int j=0;j<i;j++)
			if(t[j]!=s[n-i+j])
				b=false;
		if(b)
			A=i;
	}
	cout<<2*n-A;
	return 0;
}
```