#include<cstdio>
const int N=105;
int n;char s[N],t[N];
inline int ck(int x)
{
	for(int i=1;i<=x;++i)
		if(s[n-x+i]!=t[i])return 0;
	return 1;
}
int main()
{
	scanf("%d%s%s",&n,s+1,t+1);
	for(int i=n;~i;--i)if(ck(i))
		return printf("%d",2*n-i),0;
	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<cstdio>
const int N=105;
int n;char s[N],t[N];
inline int ck(int x)
{
	for(int i=1;i<=x;++i)
		if(s[n-x+i]!=t[i])return 0;
	return 1;
}
int main()
{
	scanf("%d%s%s",&n,s+1,t+1);
	for(int i=n;~i;--i)if(ck(i))
		return printf("%d",2*n-i),0;
	return 0;
}
```