// 2022 IUSB Programming Competition
// Round 2 Problem 3
// Plagiarism Detection
// Solution by Liguo Yu

import java.util.Scanner;

public class round2_p3
{	
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        String s1 = input.nextLine();
        String s2 = input.nextLine();
        String s3 = input.nextLine();
        
        int length = LCS(s1, s2, s3);
        System.out.println(length);
    }
    
    public static int LCS(String s1, String s2, String s3)
    {       
        int size1 = s1.length();      
        int result = 0;
        
        for(int i=0; i<size1; i++)
        {
            for(int j=i+1; j<size1+1; j++)
            {
                String sub1 = s1.substring(i, j);
                if(s2.contains(sub1) && s3.contains(sub1))
                {
                    if (sub1.length() > result)
                    {
                        result = sub1.length();
                    }
                }
            }
        }    
        return result;
    }
}