#include<cmath>
#include<set>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include <iostream>
#include<algorithm>
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200000 + 10;
const ull seed = 131;
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
char s[maxn], p[maxn], snew1[maxn];
int pos[maxn], num[maxn];
ull hs[maxn], hp[maxn], fac[maxn], q[maxn];
inline ull getHashP(int l, int r){return hp[r] - (l == 0? 0 : hp[l - 1]) * fac[r - l + 1];
}
inline ull getHashS(int l, int r){return hs[r] - (l == 0? 0 : hs[l - 1]) * fac[r - l + 1];
}
int lens, lenp, lenSnew;
int init(int len){int cnt = 0;snew1[cnt] = '$';for(int i = 0; i < len; i++){snew1[++cnt] = '#';snew1[++cnt] = s[i];}snew1[++cnt] = '#';snew1[++cnt] = '\0';return cnt;
}
int Manacher(){int cnt = init(lens);lenSnew = cnt;int id = 0, ans = -1;for(int i = 2; i < cnt; i++){if(pos[id] + id > i){pos[i] = min(pos[2 * id - i], pos[id] + id - i);}else pos[i] = 1;while(snew1[i - pos[i]] == snew1[i + pos[i]])pos[i]++;if(id + pos[id] < i + pos[i])id = i;ans = max(ans,pos[i] - 1);}return ans; //长度
}
bool mid(int l, int r, ull aim){while(l <= r){int m = (l + r) >> 1;if(q[m] >= aim){if(q[m] == aim) return true;r = m - 1;}else l = m + 1;}return false;
}
unordered_map<ull, int> mp;
//$#a#a#a#0
bool checkJi(int len){mp.clear();for(int i = 2; i + len - 1 < lenSnew; i += 2){   //sif(pos[i] - 1 >= len){int R = len / 2;int position = i / 2 - 1;   //实际位置mp[getHashS(position - R, position + R)] = 1;}}for(int i = 0; i + len - 1 < lenp; i++){ull aim = getHashP(i, i + len - 1);if(mp.count(aim)) return true;}return false;
}
//$#c#a#a#a#a#0
bool checkOu(int len){mp.clear();for(int i = 1; i + len - 1 < lenSnew; i += 2){   //sif(pos[i] - 1 >= len){int R = len / 2;int position = i / 2 - 1;   //实际位置mp[getHashS(position - R + 1, position + R)] = 1;}}for(int i = 0; i + len - 1 < lenp; i++){ull aim = getHashP(i, i + len - 1);if(mp.count(aim)) return true;}return false;
}
int main(){fac[0] = 1;for(int i = 1; i < 100010; i++)fac[i] = fac[i - 1] * seed;while(scanf("%s%s", s, p) != EOF){lens = lenp = 0;hs[0] = hp[0] = 0;for(int i = 0; s[i] != '\0'; i++){  //hashif(i == 0) hs[i] = s[i];else hs[i] = hs[i - 1] * seed + s[i];lens++;}for(int i = 0; p[i] != '\0'; i++){if(i == 0) hp[i] = p[i];else hp[i] = hp[i - 1] * seed + p[i];lenp++;}int R = Manacher(); //马拉车返回s最大长度int l, r, ans = 0;l = 1, r = R / 2;while(l <= r){  //偶int m = (l + r) >> 1;if(checkOu(m * 2)){l = m + 1;ans = m * 2;}else r = m - 1;}l = ans / 2, r = R / 2;while(l <= r){  //奇int m = (l + r) >> 1;if(checkJi(m * 2 + 1)){l = m + 1;ans = max(m * 2 + 1, ans);}else r = m - 1;}printf("%d\n", ans);}return 0;
}

#include<cmath>
#include<set>
#include<queue>
#include<cstdio>
#include<vector>
#include<cstring>
#include <iostream>
#include<algorithm>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 200000 + 10;
const ull seed = 131;
const int INF = 0x3f3f3f3f;
const int MOD = 1000000007;
char s[maxn], p[maxn], snew1[maxn], snew2[maxn];
int pos[maxn], num[maxn];
ull hs[maxn], hp[maxn], fac[maxn], q[maxn];
inline ull getHashP(int l, int r){return hp[r] - (l == 0? 0 : hp[l - 1]) * fac[r - l + 1];
}
inline ull getHashS(int l, int r){return hs[r] - (l == 0? 0 : hs[l - 1]) * fac[r - l + 1];
}
int lens, lenp, lenSnew;
int init(int len){int cnt = 0;snew1[cnt] = '$';for(int i = 0; i < len; i++){snew1[++cnt] = '#';snew1[++cnt] = s[i];}snew1[++cnt] = '#';snew1[++cnt] = '\0';return cnt;
}
int Manacher(){int cnt = init(lens);lenSnew = cnt;int id = 0, ans = -1;for(int i = 2; i < cnt; i++){if(pos[id] + id > i){pos[i] = min(pos[2 * id - i], pos[id] + id - i);}else pos[i] = 1;while(snew1[i - pos[i]] == snew1[i + pos[i]])pos[i]++;if(id + pos[id] < i + pos[i])id = i;ans = max(ans,pos[i] - 1);}return ans; //长度
}
bool mid(int l, int r, ull aim){while(l <= r){int m = (l + r) >> 1;if(q[m] >= aim){if(q[m] == aim) return true;r = m - 1;}else l = m + 1;}return false;
}
bool check(int len){int tol = 0;for(int i = 0; i + len - 1 < lenp; i++){    //p子串q[tol++] = getHashP(i, i + len - 1);}sort(q, q + tol);for(int i = 2; i < lenSnew; i += 2){  //找sif(pos[i] - 1 >= len){int R = len / 2;int position = i / 2 - 1;   //实际位置ull aim = getHashS(position - R, position + R);if(mid(0, tol - 1, aim)){return true;}}}return false;
}
int main(){fac[0] = 1;for(int i = 1; i < maxn; i++)fac[i] = fac[i - 1] * seed;while(scanf("%s%s", snew1, snew2) != EOF){lens = 0, lenp = 0;//改成全奇回文s[lens++] = '0';for(int i = 0; snew1[i] != '\0'; i++){s[lens++] = snew1[i];s[lens++] = '0';}p[lenp++] = '0';for(int i = 0; snew2[i] != '\0'; i++){p[lenp++] = snew2[i];p[lenp++] = '0';}hs[0] = hp[0] = 0;for(int i = 0; i < lens; i++){  //hashif(i == 0) hs[i] = s[i];else hs[i] = hs[i - 1] * seed + s[i];}for(int i = 0; i < lenp; i++){if(i == 0) hp[i] = p[i];else hp[i] = hp[i - 1] * seed + p[i];}int cnt = lenSnew;int L = 1, R = Manacher(); //马拉车返回最大长度int l = 1, r = R / 2; //R = 2 * r + 1int ans = 0;while(l <= r){int m = (l + r) >> 1;if(check(2 * m + 1)){ans = 2 * m + 1;l = m + 1;}else{r = m - 1;}}printf("%d\n", ans / 2);}return 0;
}