#include <cstdio>#include <cstring>#include <cmath>#include <string>#include <iostream>#include <algorithm>#include <queue>#include <set>#include <map>using namespace std;typedef long long ll;#define rep(i, n) for(int i=0; i<(n); ++i)#define for1(i,a,n) for(int i=(a);i<=(n);++i)#define for2(i,a,n) for(int i=(a);i<(n);++i)#define for3(i,a,n) for(int i=(a);i>=(n);--i)#define for4(i,a,n) for(int i=(a);i>(n);--i)#define CC(i,a) memset(i,a,sizeof(i))#define read(a) a=getint()#define print(a) printf("%d", a)#define dbg(x) cout << (#x) << " = " << (x) << endl#define error(x) (!(x)?puts("error"):0)#define rdm(x, i) for(int i=ihead[x]; i; i=e[i].next)inline const int getint() { int r=0, k=1; char c=getchar(); for(; c<‘0‘||c>‘9‘; c=getchar()) if(c==‘-‘) k=-1; for(; c>=‘0‘&&c<=‘9‘; c=getchar()) r=r*10+c-‘0‘; return k*r; }struct sam {	static const int N=200005;	int c[N][26], l[N], f[N], root, last, cnt;	sam() { cnt=0; root=last=++cnt; }	void add(int x) {		int now=last, a=++cnt; last=a;		l[a]=l[now]+1;		for(; now && !c[now][x]; now=f[now]) c[now][x]=a;		if(!now) { f[a]=root; return; }		int q=c[now][x];		if(l[q]==l[now]+1) { f[a]=q; return; }		int b=++cnt;		memcpy(c[b], c[q], sizeof c[q]);		l[b]=l[now]+1;		f[b]=f[q];		f[q]=f[a]=b;		for(; now && c[now][x]==q; now=f[now]) c[now][x]=b;	}	void build(char *s) {		int len=strlen(s);		rep(i, len) add(s[i]-‘a‘);	}	int find(char *s) {		int ret=0, len=strlen(s), now=1, t=0;		rep(i, len) {			int x=s[i]-‘a‘;			if(c[now][x]) now=c[now][x], ++t;			else {				while(now && !c[now][x]) now=f[now];				if(!now) now=root, t=0;				else t=l[now]+1, now=c[now][x];			}			ret=max(ret, t);		}		return ret;	}}a;const int N=100005;char s[N];int main() {	scanf("%s", s);	a.build(s);	scanf("%s", s);	printf("%d\n", a.find(s));	return 0;}