
#include<stdio.h>
int n;
char p[110], q[110];
int main(){
    int i, j;
    scanf("%d",&n);
    scanf("%s%s",p,q);
    for(i=n;i>=1;i--){
        for(j=0;j<i;j++){
            if(q[j] != p[n-i+j])break;
        }
        if(j==i)break;
    }
    printf("%d\n",2*n-i);
}
### Prompt

Your challenge is to write 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<stdio.h>
int n;
char p[110], q[110];
int main(){
    int i, j;
    scanf("%d",&n);
    scanf("%s%s",p,q);
    for(i=n;i>=1;i--){
        for(j=0;j<i;j++){
            if(q[j] != p[n-i+j])break;
        }
        if(j==i)break;
    }
    printf("%d\n",2*n-i);
}
```