#include<bits/stdc++.h>
using namespace std;

int n,ans;
char a[1005],b[1005];

int main(){
	int i,j;
	scanf("%d%s%s",&n,a+1,b+1);
	for(i=n;i;--i){
		for(j=1;j<=i;++j)
		 if(a[n-i+j]!=b[j]) break;
		if(j>i) {ans=i;break;}
	}
	cout<<n+n-ans;
}
### Prompt

Your task is to create 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<bits/stdc++.h>
using namespace std;

int n,ans;
char a[1005],b[1005];

int main(){
	int i,j;
	scanf("%d%s%s",&n,a+1,b+1);
	for(i=n;i;--i){
		for(j=1;j<=i;++j)
		 if(a[n-i+j]!=b[j]) break;
		if(j>i) {ans=i;break;}
	}
	cout<<n+n-ans;
}
```