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++14 (GCC 5.4.1) (judge verdict: Accepted)

#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <utility>
#include <cstdio>
#include <iostream>
#include <iomanip>
#include<string>
#include <stack>
#include<queue>
#include<map>
#include <stdlib.h>
#include <bits/stdc++.h>
#include <set>

using namespace std;

int main() {
	int n;
	bool f = false;
	string s, t, w;
	cin >> n >> s >> t;
	w = s.substr(0);
	if (w == t) {
		cout << s.length() << endl;
		return 0;
	}
	for (int i = 0; i < s.length(); i++) {
		w = s.substr(s.length() - i);
		if (w == t.substr(0, i) && w != "") {
			cout << (s.substr(0, s.length() - i) + t).length() << endl;
			f = true;
		}

	}
	if (f == false) {
		cout << (s + t).length() << endl;
	}

	return 0;
}