#include<bits/stdc++.h>
using namespace std;
int main(){
  int N,ans=0;string S,T;cin>>N>>S>>T;
  for(int i=N-1;i>=0;i--){
    if(S.substr(N-i-1)==T.substr(0,i+1)){
      ans=N*2-i-1;
      break;
    }
  }
  if(ans==0)ans=2*N;
  cout<<ans<<endl;
}
### 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<bits/stdc++.h>
using namespace std;
int main(){
  int N,ans=0;string S,T;cin>>N>>S>>T;
  for(int i=N-1;i>=0;i--){
    if(S.substr(N-i-1)==T.substr(0,i+1)){
      ans=N*2-i-1;
      break;
    }
  }
  if(ans==0)ans=2*N;
  cout<<ans<<endl;
}
```