#include #include //#include using ll=long long; using lu=unsigned long long; #define rep(i,a,b) for(int i=a;i; using PD=pair; using PL=pair; using PH=pair; using PS=pair; int mod1=998244353; int mod2=1000000007; const ll INF = 5000000000000000000; const int big = 2147483647; ll N=1; /*struct st{ ll x,y,z; st(ll x=0,ll y=0,ll z=0):x(x),y(y),z(z){} bool operator>(const st &a) const { if (x != a.x) return x > a.x; if (y != a.y) return y > a.y; return z > a.z; } };*/ vector> A(10010); vectorrec(5010,INF); //mt19937_64 rng(1644); const ll mod=(1ll<<61)-1; int main(){//16:30 //ll n=0,q,y=0,i=0,z=0,x=0,d=0,k=0,nk,sum=0; //ll ans=INF,sum2=0,rs=-INF,cs=0,l=0,h=0,r=0; //ll a=0,b=0,c=0,j=0,m=0,K=0; ll M=0,R,w,L; string s; cin>>s; N=s.size(); rep(i,0,N){ ll res=0; rep(j,i,N){ (res*=1234567)%=mod; (res+=(s[j]-'a'))%=mod; A[i].push_back(res); } } bool jud=false; auto f=[&](auto f,int l,int r)->ll{ //cout<