Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

3
abc
cde

Sample Output 1

5

The shortest string is abcde.

Sample Input 2

1
a
z

Sample Output 2

2

The shortest string is az.

Sample Input 3

4
expr
expr

Sample Output 3

4

The shortest string is expr.

Solution in C (GCC 5.4.1) (judge verdict: Accepted)

#include<stdio.h>
char a[2][200];
int main()
{
	int n,i,j,k;
	
	scanf("%d",&n);
	getchar();
	for(i=0;i<n;i++)
	scanf("%c",&a[0][i]);
	getchar();
	for(i=0;i<n;i++)
	scanf("%c",&a[1][i]);
	//puts(a[0]);
	//puts(a[1]);
	for(i=0;i<n;i++)
	{
		if(a[0][i]==a[1][0])
		{
			for(j=i,k=0;j<n;j++,k++)
			{
				if(a[0][j]!=a[1][k])
				{
					break;
					j--;
				}
			}
			if(j==n)
			{
				printf("%d\n",n+(n-k));
				return 0;
		    }
	    } 
    }
	if(i==n)
	printf("%d\n",n*2); 
	return 0;
}