#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)

int main(){
	int n; string s,t; cin>>n>>s>>t;
	string s1,t1;
	int cnt=0;
	rep(i,n){
		s1=s.substr(i,n), t1=t.substr(0,n-i);
		if(s1==t1) {cnt=s1.size(); break;}
	}
	cout<<2*n-cnt<<endl;
}
### 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;
#define rep(i,n) for(int i=0; i<(n); i++)

int main(){
	int n; string s,t; cin>>n>>s>>t;
	string s1,t1;
	int cnt=0;
	rep(i,n){
		s1=s.substr(i,n), t1=t.substr(0,n-i);
		if(s1==t1) {cnt=s1.size(); break;}
	}
	cout<<2*n-cnt<<endl;
}
```