#include<bits/stdc++.h>

#define N 1000010

using namespace std;

typedef long long ll;

int a[N],n;ll ans=;

struct Suffix_Automaton{

    int cnt,last,ch[N<<][],l[N<<],fa[N<<];

    Suffix_Automaton(){cnt=last=;}

    void ins(int c){

        int p=last,np=++cnt;last=np;l[np]=l[p]+;

        for(;p&&!ch[p][c];p=fa[p])ch[p][c]=np;

        if(!p)fa[np]=;

        else{

            int q=ch[p][c];

            if(l[p]+==l[q])fa[np]=q;

            else{

                int nq=++cnt;l[nq]=l[p]+;

                memcpy(ch[nq],ch[q],sizeof(ch[q]));

                fa[nq]=fa[q];fa[np]=fa[q]=nq;

                for(;p&&ch[p][c]==q;p=fa[p])ch[p][c]=nq;

            }

        }

        ans+=l[np]-l[fa[np]];

    }

}sam;

inline char read(){

    char ch;

    do{ch=getchar();}while(ch<'a'||ch>'z');

    return ch;

}

int main(){

    char c=read();

    while(c>='a'&&c<='z')a[++n]=c-'a',c=getchar();

    for(int i=;i<=n;i++)sam.ins(a[i]);

    printf("%lld\n",ans);

    return ;

}