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

Create a solution in cpp for 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 main(void)
{
	int n,i,j,r,x;
	char s[111],t[111];
	scanf("%d %s %s",&n,s,t);
	r=2*n;
	for(i=1;i<=n;i++){
		x=n-i;
		for(j=0;j<i;j++){
			if(s[j+x]!=t[j])
				break;
			if(j==i-1)
				r=2*n-i;
		}
	}
	printf("%d\n",r);
	return 0;
}
```