#include<bits/stdc++.h>
using namespace std;
char s[200],t[200];
int main(){
	int n;
	scanf("%d",&n);
	scanf("%s%s",s,t);
	for(int i=n;i>=0;i--){
		bool flag=true;
		for(int j=0;j<i;j++){
			if(s[n-i+j]!=t[j]) flag=false;
		}
		if(flag){
			printf("%d\n",n+n-i);
			break;
		}
	}
	return 0;
}
### Prompt

Please formulate 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;
char s[200],t[200];
int main(){
	int n;
	scanf("%d",&n);
	scanf("%s%s",s,t);
	for(int i=n;i>=0;i--){
		bool flag=true;
		for(int j=0;j<i;j++){
			if(s[n-i+j]!=t[j]) flag=false;
		}
		if(flag){
			printf("%d\n",n+n-i);
			break;
		}
	}
	return 0;
}
```