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 Java7 (OpenJDK 1.7.0) (judge verdict: Runtime Error)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.*;

public class Main{

	public static void main(String[] args) throws IOException {
		MyScanner sc = new MyScanner(System.in);
		int n=sc.nextInt();
		int x = sc.nextInt();
		if(x==1||x==2*n-1) {
			System.out.println("No");
			return;
		}
		System.out.println("Yes");
		if(n==2) {
			System.out.println(1);
			System.out.println(2);
			System.out.println(3);
			return;
		}
//		if(x+1!=2*n-1) {
			Queue<Integer> q=new ArrayDeque<>();
			for(int i=2; i<2*n-1;i++) {
				if(i!=x+1&&i!=x)
					q.add(i);
			}
			for(int i=0; i<n-3; i++) {
				int e=q.poll();
				System.out.println(e);
			}
			System.out.println(x+1);
			System.out.println(1);
			System.out.println(x);
			System.out.println(2*n-1);
			for(int i=0; i<n-2; i++) {
				System.out.println(q.poll());
			}	
//		} else {
//			Queue<Integer> q=new ArrayDeque<>();
//			for(int i=2; i<2*n-1;i++) {
//				if(i!=x-1&&i!=x)
//					q.add(i);
//			}
//			for(int i=0; i<n-3; i++) {
//				int e=q.poll();
//				System.out.println(e);
//			}
//			System.out.println(x-1);
//			System.out.println(1);
//			System.out.println(x);
//			System.out.println(2*n-1);
//			for(int i=0; i<n-2; i++) {
//				System.out.println(q.poll());
//			}	
//		}
	}

	static class MyScanner
	{
		BufferedReader br;
		StringTokenizer st;
		public MyScanner(InputStream s) 
		{
			br=new BufferedReader(new InputStreamReader(s));
		}
		public String nextLine() throws IOException
		{
			return br.readLine();
		}
		public String next() throws IOException
		{
			while(st==null || !st.hasMoreTokens())
				st=new StringTokenizer(br.readLine());
			return st.nextToken();
		}
		public int nextInt() throws IOException
		{
			return Integer.parseInt(next());
			
		}
		public double nextDouble() throws IOException
		{
			return Double.parseDouble(next());
		}
		public boolean ready() throws IOException
		{
			return br.ready();
		}
		public long nextLong() throws IOException
		{
			return Long.parseLong(next());
		}
	}
}