#include <cstdio>

 #include <cstring>

 #include <algorithm>

 using namespace std;

 const int maxn =  + ;

 char s[maxn];

 int n;

 int sa[maxn], rank[maxn], height[maxn];

 int t[maxn], t2[maxn], c[maxn];

 void build_sa(int n, int m)

 {

     int i, *x = t, *y = t2;

     for(i = ; i < m; i++) c[i] = ;

     for(i = ; i < n; i++) c[x[i] = s[i]]++;

     for(i = ; i < m; i++) c[i] += c[i - ];

     for(i = n - ; i >= ; i--) sa[--c[x[i]]] = i;

     for(int k = ; k <= n; k <<= )

     {

         int p = ;

         for(i = n - k; i < n; i++) y[p++] = i;

         for(i = ; i < n; i++) if(sa[i] >= k) y[p++] = sa[i] - k;

         for(i = ; i < m; i++) c[i] = ;

         for(i = ; i < n; i++) c[x[y[i]]]++;

         for(i = ; i < m; i++) c[i] += c[i - ];

         for(i = n - ; i >= ; i--) sa[--c[x[y[i]]]] = y[i];

         swap(x, y);

         p = ; x[sa[]] = ;

         for(i = ; i < n; i++)

             x[sa[i]] = y[sa[i]]==y[sa[i-]] && y[sa[i]+k]==y[sa[i-]+k] ? p -  : p++;

         if(p >= n) break;

         m = p;

     }

 }

 void build_height()

 {

     int k = ;

     for(int i = ; i <= n; i++) rank[sa[i]] = i;

     for(int i = ; i < n; i++)

     {

         if(k) k--;

         int j = sa[rank[i] - ];

         while(s[i + k] == s[j + k]) k++;

         height[rank[i]] = k;

     }

 }

 int main()

 {

     //freopen("in.txt", "r", stdin);

     scanf("%s", s);

     int pos = strlen(s);

     s[pos] = ;

     scanf("%s", s + pos + );

     n = strlen(s);

     build_sa(n + , );

     build_height();

     int ans = ;

     for(int i = ; i <= n; i++)

     {

         if(height[i] > ans)

         {

             if((sa[i]>pos && sa[i-]<pos) || (sa[i]<pos&&sa[i-]>pos))

                 ans = height[i];

         }

     }

     printf("%d\n", ans);

     return ;

 }