#include using namespace std; const int MOD = 100003; inline int mod(long long n){ if(n >= 0) return n % MOD; return ((-n/MOD+1)*MOD + n) % MOD; } int arr[10000][10000]; int dp[5001]; bool issame = true; int L1,R1,L2,R2; char S[200001]; int main() { scanf("%s", S); int L = strlen(S); for(int mid=1;mid<=L;mid++) { int H = 0, power = 1; for(int i=0; i<=L-mid; i++){ if(i == 0){ for(int j=0; j