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

#include <iostream>
#include <string>
using namespace std;

int LCS(string s1, string s2, string s3);

int main()
{
	char c1[100];
	char c2[100];
	char c3[100];
	cin.getline(c1, 100);
	cin.getline(c2, 100);
	cin.getline(c3, 100);
	string s1 = c1;
	string s2 = c2;
	string s3 = c3;

	int length = LCS(s1, s2, s3);
	cout << length << "\n";
}
 
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.substr(i, j-i);
      if(s2.find(sub1)!=std::string::npos && s3.find(sub1)!=std::string::npos)
      {
         if (sub1.length() > result)
          {
            result = sub1.length();
          }
      }
    }
  }    
  return result;
}