//satyaki3794
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define MOD (1000000007LL)
#define LEFT(n) (2*(n))
#define RIGHT(n) (2*(n)+1)
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> ii;
typedef pair<int, ii> iii;
 
ll pwr(ll base, ll p, ll mod=MOD){
ll ans = 1;while(p){if(p&1)ans=(ans*base)%mod;base=(base*base)%mod;p/=2;}return ans;
}
 
 
ll gcd(ll a, ll b){
    if(b == 0)  return a;
    return gcd(b, a%b);
}



int n, lps[100005], cnt[100005];
string str;


ll solve(string str){

    int n = (int)str.length();
    lps[0] = cnt[0] = 0;
    ll ans = 0;
    for(int i=1;i<n;i++){
        int j = lps[i-1];
        while(j > 0 && str[j] != str[i])    j = lps[j-1];
        if(str[j] == str[i])    j++;
        lps[i] = j;
        int period = (i+1) - lps[i];
        if((i+1) % period == 0)
            ans += (i+1)/period-1;
    }

// for(int i=0;i<n;i++)    cout<<lps[i]<<" ";cout<<endl;
// for(int i=0;i<n;i++)    cout<<cnt[i]<<" ";cout<<endl;
// cout<<"solve "<<str<<" returns "<<ans<<endl;
    return ans;
}

 
int main(){
 
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>str;
    n = (int)str.length();

    ll ans = 0;
    for(int i=0;i<n;i++){
        ans += solve(str.substr(i));
    }

    ans *= 2;
    ans += 1LL*n*(n+1)/2;
    cout<<ans;
    return 0;
}