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 s[105];
char t[105];

int main() {

	int N;

	scanf("%d",&N);

	scanf("%s",s);
	scanf("%s",t);

	int i, j;

	int ans = 2 * N;

	for (i = 0; i < N; i++) {
		int cnt = 0;
		for (j = 0; j < N; j++) {
			if (i + j < N) {
				if (s[i + j] == t[j]) { cnt++; }
				else {
					cnt = 0;
					break;
				}
			}
		}
		if (cnt > 0) {
			printf("%d\n", ans - cnt);
			return 0;
		}
	}
	printf("%d\n", ans);

	return 0;
}