import java.util.Scanner;

public class Talent {
	/* The input strings */
	private static String s1, s2;

	/* Finds the length of the longest string that
	 * is a prefix of s1 and suffix of s2.
	 */ 
	private static int solve() {

                /* ------------------- INSERT CODE HERE ---------------------*/






                /* -------------------- END OF INSERTION --------------------*/

		return 0;
	}
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		s1 = sc.next();
		s2 = sc.next();
		int len = solve();
		if (len > 0)
			System.out.print(s1.substring(0, len)+" ");
		System.out.println(len);
	}
}