123D

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 500010
ll ans;
int n,k, top;
char s[N];
int Rank[N],sa[N],temp[N],lcp[N],st[N][2],l[N],r[N];
inline bool cp(int i,int j)
{
    if(Rank[i]!=Rank[j]) return Rank[i]<Rank[j];
    int ri=i+k<=n?Rank[i+k]:-1;
    int rj=j+k<=n?Rank[j+k]:-1;
    return ri<rj;
}
void Sa()
{
    for(int i=1;i<=n;++i)
    {
        Rank[i]=s[i]; sa[i]=i;
    }
    for(k=1;k<=n;k<<=1)
    {
        sort(sa+1,sa+n+1,cp);
        temp[sa[1]]=1;
        for(int i=2;i<=n;++i) temp[sa[i]]=temp[sa[i-1]]+(cp(sa[i-1],sa[i]));
        for(int i=1;i<=n;++i) Rank[i]=temp[i];
    }
}
void Lcp()
{
    for(int i=1;i<=n;++i) Rank[sa[i]]=i;
    int h=0;
    for(int i=1;i<=n;++i)
    {
        if(Rank[i]<=1) continue;
        int j=sa[Rank[i]-1];
        if(h>0) --h;
        for(;i+h<=n&&j+h<=n;++h) if(s[i+h]!=s[j+h]) break;
        lcp[Rank[i]]=h;
    }
}
ll mul(ll x)
{
    return x * (x + 1ll) / 2ll;
}
int main()
{
    scanf("%s",s+1);
    n = strlen(s + 1);
    Sa();
    Lcp();
    for(int i = 1; i <= n; ++i)
    {
        ans += (ll)(n - sa[i] + 1) - max(lcp[i], lcp[i + 1]);
        int left = i;
        while(top && lcp[i + 1] < st[top][1])
        {
            ans += mul(i - st[top][0] + 1) * (st[top][1] - max(st[top - 1][1], lcp[i + 1]));
            left = st[top][0];
            --top;
        }
        ++top;
        st[top][0] = left;
        st[top][1] = lcp[i + 1];
    }
    printf("%lld\n", ans);
    return 0;
}