#pragma warning(disable:4786)
#pragma warning(disable:4996)
#include<list>
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<set>
#include<map>
#include<functional>
#include<string>
#include<cstring>
#include<cstdlib>
#include<queue>
#include<utility>
#include<fstream>
#include<sstream>
#include<cmath>
#include<stack>
#include<assert.h>
using namespace std;
 
#define MEM(a, b) memset(a, (b), sizeof(a))
#define CLR(a) memset(a, 0, sizeof(a))
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
#define ABS(X) ( (X) > 0 ? (X) : ( -(X) ) )
#define S(X) ( (X) * (X) )
#define SZ(V) (int )V.size()
#define FORN(i, n) for(i = 0; i < n; i++)
#define FORAB(i, a, b) for(i = a; i <= b; i++)
#define ALL(V) V.begin(), V.end()
#define IN(A, B, C)  ((B) <= (A) && (A) <= (C))
 
typedef pair<int,int> PII;
typedef pair<double, double> PDD;
typedef vector<int> VI;
typedef vector<PII > VP;
 
#define AIN(A, B, C) assert(IN(A, B, C))
 
//typedef int LL;
typedef long long int LL;
//typedef __int64 LL;
 
char S1[250005], S2[250005];
int len1, len2;
 
int vis[35000000];
int head[35000000];
int nextCell[35000000];
int info[35000000];
int node;
 
LL prime2 = 34369934, prime1 = 9584612342;
int mark;
int cnt;
 
void insert(int hash, int start)
{
	if(vis[hash] != mark)
	{
		vis[hash] = mark;
		head[hash] = -1;
	}
 
	info[node] = start;
	nextCell[node] = head[hash];
	head[hash] = node++;
}
 
int check(int hash, int at, int len)
{
	if(vis[hash] != mark) return 0;
	
	int flag, j, i;
	for(i = head[hash]; i != -1; i = nextCell[i])
	{
		int val = info[i];
		flag = 1;
		for(j = 0; j < len; j++)
		{
			cnt++;
			if(S1[val + j] != S2[at + j])
			{
				flag = 0;
				break;
			}
		}
 
		if(flag) 
			return 1;
	}
 
	return 0;
}
 
int possible(int len)
{
	mark++;
	node = 0;
 
	if(len == 0) return -1;
 
	LL hash = 0, mul = 1;
	int i;
 
	for(i = 0; i < len; i++)
	{
		hash = (hash * prime1 + S1[i]) % prime2;
		mul = (mul * prime1) % prime2;
	}
 
	mul = (prime2 - mul) % prime2;
 
	insert(hash, 0);
	for(; i < len1; i++)
	{
		hash = (hash * prime1 + S1[i] + mul * S1[i - len]) % prime2;
		insert(hash, i - len + 1);
	}
 
	hash = 0;
	for(i = 0; i < len; i++)
	{
		hash = (hash * prime1 + S2[i]) % prime2;
	}
 
	if(check(hash, 0, len)) return 0;
	for(; i < len2; i++)
	{
		hash = (hash * prime1 + S2[i] + mul * S2[i - len]) % prime2;
		if(check(hash, i - len + 1, len)) return i - len + 1;
	}
 
	return -1;
}
 
int main()
{
	
 
	int lo, hi, mid, index;
 
	scanf("%s %s", S1, S2);
 
	len1 = strlen(S1);
	len2 = strlen(S2);
 
	lo = 0; hi = len2;
	while(lo < hi)
	{
		mid = (lo + hi + 1) >> 1;
		if(possible(mid) != -1) lo = mid;
		else hi = mid - 1;
	}
 
	index = possible(lo);
	if(index != -1) 
	{
		S2[index + lo] = 0;
		printf("%s\n", S2 + index);
	}
	
	printf("%d\n", lo);
 
	return 0;
}