#include<iostream>

 #include<cstdio>

 #include<cmath>

 #include<algorithm>

 #include<queue>

 #include<cstring>

 #define PAU putchar(' ')

 #define ENT putchar('\n')

 using namespace std;

 const int maxn=+,sig=;

 struct SAM{

     struct node{

         int len;node*p,*tx[sig];

     }sam[maxn<<],*nodecnt,*root,*x;

     void init(){nodecnt=sam;return;}

     node*newnode(int len=){node*t=nodecnt++;t->len=len;return t;}

     void extend(int pos,char ch){

         int c=ch-'a';node*p=x;x=newnode(pos+);

         for(;p&&!p->tx[c];p=p->p) p->tx[c]=x;

         if(!p) x->p=root;

         else{ node*q=p->tx[c];

             if(q->len==p->len+) x->p=q;

             else{ node*r=newnode();

                 r[]=q[];r->len=p->len+;q->p=x->p=r;

                 for(;p&&p->tx[c]==q;p=p->p) p->tx[c]=r;

             }

         } return;

     }

     void build(char*s){x=root=newnode();for(int i=;s[i];i++)extend(i,s[i]);return;}

     int query(char*t){

         int len=strlen(t),ans=;node*p=root;

         for(int i=,L=;i<len;i++){

             int c=t[i]-'a';

             if(p->tx[c])L++,p=p->tx[c];

             else{

                 for(;p&&!p->tx[c];p=p->p);

                 if(p) L=p->len+,p=p->tx[c];

                 else p=root,L=;

             } ans=max(L,ans);

         } return ans;

     }

 }sol;

 inline int read(){

     int x=,sig=;char ch=getchar();

     while(!isdigit(ch)){if(ch=='-')sig=-;ch=getchar();}

     while(isdigit(ch))x=*x+ch-'',ch=getchar();

     return x*=sig;

 }

 inline void write(int x){

     if(x==){putchar('');return;}if(x<)putchar('-'),x=-x;

     int len=,buf[];while(x)buf[len++]=x%,x/=;

     for(int i=len-;i>=;i--)putchar(buf[i]+'');return;

 }

 char s[maxn],t[maxn];

 void init(){

     scanf("%s%s",s,t);

     sol.init();sol.build(s);write(sol.query(t));

     return;

 }

 void work(){

     return;

 }

 void print(){

     return;

 }

 int main(){init();work();print();return ;}