#include<cstdio>
using namespace std;
int n,ans;char a[105],b[105];
int main(){
	scanf("%d%s%s",&n,a+1,b+1);
	for (int i=1;i<=n;i++)
	for (int j=n-i+1,k=1;j<=n;j++,k++)
	if(a[j]^b[k]) break;else if(j==n) ans=i;
	printf("%d\n",2*n-ans);
	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<cstdio>
using namespace std;
int n,ans;char a[105],b[105];
int main(){
	scanf("%d%s%s",&n,a+1,b+1);
	for (int i=1;i<=n;i++)
	for (int j=n-i+1,k=1;j<=n;j++,k++)
	if(a[j]^b[k]) break;else if(j==n) ans=i;
	printf("%d\n",2*n-ans);
	return 0;
}
```