#include<cstdio>
using namespace std;
int j,n,i;
char s[105],t[105];
int main()
{
	scanf("%d%s%s",&n,s,t);
	for(i=n-1;i>=0;i--)
	{
		for(j=i;j>=0;j--)if(t[j]!=s[n-1+j-i])break;
		if(j==-1)
		{
			printf("%d\n",2*n-i-1);
			return 0;
		}
	}
	printf("%d\n",2*n);
	return 0;
}
### Prompt

In cpp, your task is to solve 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<cstdio>
using namespace std;
int j,n,i;
char s[105],t[105];
int main()
{
	scanf("%d%s%s",&n,s,t);
	for(i=n-1;i>=0;i--)
	{
		for(j=i;j>=0;j--)if(t[j]!=s[n-1+j-i])break;
		if(j==-1)
		{
			printf("%d\n",2*n-i-1);
			return 0;
		}
	}
	printf("%d\n",2*n);
	return 0;
}
```