#include<algorithm>

 #include<cstdlib>

 #include<cstring>

 #include<cstdio>

 #include<cmath>

 using namespace std;

 #define N 200010

 int wa[N],wb[N],wv[N],ws[N];

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

 int num[N];

 char str[N];

 int cmp(int *r,int a,int b,int l)

 {

     return r[a]==r[b] && r[a+l]==r[b+l];

 }

 void da(int *r,int n,int m)

 {

     int i,j,p,*x=wa,*y=wb,*t;

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

     for (i=;i<n;i++) ws[x[i]=r[i]]++;

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

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

     for (j=,p=;p<n;j*=,m=p)

     {

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

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

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

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

         for (i=;i<n;i++) ws[wv[i]]++;

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

         for (i=n-;i>=;i--) sa[--ws[wv[i]]]=y[i];

         for (t=x,x=y,y=t,p=,x[sa[]]=,i=;i<n;i++)

             x[sa[i]]=cmp(y,sa[i-],sa[i],j) ? p- : p++;

     }

     return ;

 }

 void calheight(int *r,int n)

 {

     int i,j,k=;

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

     for (i=;i<n;height[rank[i++]]=k)

         for (k ? k-- : ,j=sa[rank[i]-];r[i+k]==r[j+k];k++);

     return ;

 }

 int main()

 {

     int i,k,l1,l2;

     scanf("%s",str);

     l1=strlen(str);

     for (k=i=;i<l1;i++)

         num[k++]=str[i]-'a'+;

     num[k++]=;

     scanf("%s",str);

     l2=strlen(str);

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

         num[k++]=str[i]-'a'+;

     int n=l1+l2;

     da(num,n+,);

     calheight(num,n);

     int ans=;

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

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

             ans=max(ans,height[i]);

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

     return ;

 }