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: Wrong Answer)

#include <iostream>
using namespace std;
char t[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
int main()
{
    int n,sum=0;
    char s;
    cin>>n;
    int x=n;
    while(x--)
    {
        cin>>s;
        int j=26;
        while(j--)
        {
            if(t[j]==s)
            {
               t[j]=0;
            }
        }
    }
    sum=n;
    x=n;
     while(x--)
    {
        cin>>s;
        int j=26;
        while(j--)
        {
            if(t[j]==s)
            {
                sum++;
               t[j]=0;
            }
        }
    }
    cout<<sum<<endl;
    return 0;
}