ll p[N],h[N],hb[N],base=1333331,mod=1e9+7; int T,n; string a,b; ll cal(int l,int r){ return (h[r]-h[l-1]*p[r-l+1]%mod+mod)%mod; } ll calb(int l,int r){ return (hb[r]-hb[l-1]*p[r-l+1]%mod+mod)%mod; } void ini(){ p[0]=1; for(int i=1;i<N;i++) p[i]=p[i-1]*base%mod; } void solve(){ string temp=a; reverse(a.begin()+1,a.end()); for(int i=1;i<=n;i++){ h[i]=h[i-1]*base+a[i]-'a',h[i]%=mod; hb[i]=hb[i-1]*base+b[i]-'a',hb[i]%=mod; } vector<int> suf(n+2,0); for(int i=n;i>=1;i--){ if(temp[i]==b[i]) suf[i]=1,suf[i]+=suf[i+1]; else suf[i]=0; } map<int,vector<int>> mp; for(int i=1;i<=n;i++){ int l=i,r=n; while(l<=r){ int mid=(l+r)/2; if(cal(i,mid)==calb(1,mid-i+1)) l=mid+1; else r=mid-1; } // cout<<r<<' '; if(r<i) continue; int val=r-i+1; if(r==n) val+=suf[n-i+2]; mp[val].push_back(n-i+1); } if(mp.empty()){ cout<<0<<' '<<1<<'\n'; return; } cout<<mp.rbegin()->first<<' '<<*min_element(all(mp.rbegin()->second))<<'\n'; }