#include <cstdio>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 #define M 26

 #define N 600000

 int cnt;

 char s1[N] , s2[N];

 struct SamNode{

     SamNode *son[M] , *f;

     int l;

 }sam[N] , *root , *last;

 void init()

 {

     memset(sam ,  , sizeof(sam));

     root = last = &sam[cnt=];

 }

 void add(int x)

 {

     SamNode *p = &sam[++cnt] , *jp = last;

     p->l = jp->l+;

     last = p;

     for(; jp&&!jp->son[x] ; jp=jp->f) jp->son[x] = p;

     if(!jp) p->f = root;

     else{

         if(jp->l+ == jp->son[x]->l) p->f = jp->son[x];

         else{

             SamNode *r = &sam[++cnt] , *q = jp->son[x];

             *r = *q;

             r->l = jp->l+; q->f = p->f = r;

             for(; jp && jp->son[x]==q ; jp=jp->f) jp->son[x]=r;

         }

     }

 }

 int solve(int len)

 {

     int ret =  , maxn=;

     SamNode *cur = root;

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

         int x = s2[i]-'a';

         if(cur->son[x]){

             ret++;

             cur = cur->son[x];

         }

         else{

             while(cur && !cur->son[x]) cur = cur->f;

             if(!cur) cur = root , ret=;

             else{

                 ret = cur->l+;

                 cur = cur->son[x];

             }

         }

         maxn = max(maxn , ret);

     }

     return maxn;

 }

 int main()

 {

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

    // freopen("out.txt" , "w" , stdout);

     scanf("%s%s" , s1 , s2);

     init();

     int len1 = strlen(s1) , len2 = strlen(s2);

     for(int i= ; i<len1 ; i++) add(s1[i]-'a');

     int ret = solve(len2);

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

     return ;

 }