import java.util.Collections;
import java.util.HashMap;
import java.util.Scanner;
public class H25b
{
/**
* @查找两个字符串a,b中的最长公共子串
*/
public static String getLCS(String a,String b)
{
if (a.contains(b))
return b;
if (b.contains(a))
return a;
int length1 = a.length() , length2 = b.length();
String min = length1 <= length2? a:b;
String max = length1 > length2? a:b;
int lengthmin = min.length();
for (int j = lengthmin ; j > 0 ; j--)
{
for (int i = 0 ;i <= lengthmin-j ; i++)
{
if (max.contains( min.substring(i, i+j)) )
return min.substring(i, i+j);
}
}
return "";
}
public static void main(String[] args)
{
Scanner cin = new Scanner(System.in);
String a = cin.next();
String b = cin.next();
cin.close();
System.out.println( getLCS(a,b) );
}
}