#include<cstdio>

 #include<cstring>

 #include<algorithm>

 #define rep(i,l,r) for (int i=(l); i<=(r); i++)

 typedef long long ll;

 using namespace std;

 const int N=,inf=;

 ll ans;

 char s[N];

 int n,top,x[N],y[N],c[N],sa[N],h[N],rk[N],l[N],r[N],stk[N];

 int Cmp(int a,int b,int l){ return a+l<=n && b+l<=n && y[a]==y[b] && y[a+l]==y[b+l]; }

 void build_sa(int m){

     memset(y,,sizeof(y));

     rep(i,,m) c[i]=;

     rep(i,,n) c[x[i]=s[i]-'a'+]++;

     rep(i,,m) c[i]+=c[i-];

     for (int i=n; i; i--) sa[c[x[i]]--]=i;

     for (int k=,p=; p<n; k<<=,m=p){

          p=;

          rep(i,n-k+,n) y[++p]=i;

          rep(i,,n) if (sa[i]>k) y[++p]=sa[i]-k;

          rep(i,,m) c[i]=;

          rep(i,,n) c[x[y[i]]]++;

          rep(i,,m) c[i]+=c[i-];

          for (int i=n; i; i--) sa[c[x[y[i]]]--]=y[i];

          rep(i,,n) y[i]=x[i]; p=; x[sa[]]=;

          rep(i,,n) x[sa[i]]=Cmp(sa[i-],sa[i],k) ? p : ++p;

     }

 }

 void get(){

     int k=;

     rep(i,,n) rk[sa[i]]=i;

     rep(i,,n){

          for (int j=sa[rk[i]-]; i+k<=n && j+k<=n && s[i+k]==s[j+k]; k++);

          h[rk[i]]=k; if (k) k--;

     }

 }

 void solve(){

     rep(i,,n) ans+=1ll*i*(n-);

     h[]=-inf;

     rep(i,,n){

         while (h[i]<=h[stk[top]]) top--;

         if (!stk[top]) l[i]=; else l[i]=stk[top]+;

         stk[++top]=i;

     }

     h[n+]=-inf; top=; stk[]=n+;

     for (int i=n; i; i--){

         while (h[i]<h[stk[top]]) top--;

         if (stk[top]==n+) r[i]=n; else r[i]=stk[top]-;

         stk[++top]=i;

     }

     rep(i,,n) ans-=2ll*(i-l[i]+)*(r[i]-i+)*h[i];

 }

 int main(){

     freopen("bzoj3238.in","r",stdin);

     freopen("bzoj3238.out","w",stdout);

     scanf("%s",s+); n=strlen(s+);

     build_sa(); get(); solve(); printf("%lld\n",ans);

     return ;

 }