#include <bits/stdc++.h>
using namespace std;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin);i<(end);i++)
#define REP(i, n) FOR(i,0,n)
#define IFOR(i, begin, end) for(int i=(end)-1;i>=(begin);i--)
#define IREP(i, n) IFOR(i,0,n)
#define Sort(v) sort(v.begin(), v.end())
#define Reverse(v) reverse(v.begin(), v.end())
#define all(v) v.begin(),v.end()
#define SZ(v) ((int)v.size())
#define Lower_bound(v, x) distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) distance(v.begin(), upper_bound(v.begin(), v.end(), x))
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define bit(n) (1LL<<(n))
#define debug(x) cout << #x << "=" << x << endl;
#define vdebug(v) { cout << #v << "=" << endl; REP(i_debug, v.size()){ cout << v[i_debug] << ","; } cout << endl; }
#define mdebug(m) { cout << #m << "=" << endl; REP(i_debug, m.size()){ REP(j_debug, m[i_debug].size()){ cout << m[i_debug][j_debug] << ","; } cout << endl;} }
#define pb push_back
#define fi first
#define se second
#define int long long
#define INF 1000000000000000000
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; }
template<typename T> ostream &operator<<(ostream &os, vector<T> &v){ for(int i = 0; i < v.size(); i++) { cout << v[i]; if(i != v.size() - 1) cout << endl; }; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, pair<T1, T2> p){ cout << '(' << p.first << ',' << p.second << ')'; return os; }
template<typename T> void Out(T x) { cout << x << endl; }
template<typename T1, typename T2> void chOut(bool f, T1 y, T2 n) { if(f) Out(y); else Out(n); }

using vec = vector<int>;
using mat = vector<vec>;
using Pii = pair<int, int>;
using v_bool = vector<bool>;
using v_Pii = vector<Pii>;

//int dx[4] = {1,0,-1,0};
//int dy[4] = {0,1,0,-1};
//char d[4] = {'D','R','U','L'};

const int mod = 1000000007;
//const int mod = 998244353;

struct Compare_sa{
    const int k;
    const vector<int> &rank;
    Compare_sa(int k, vector<int> &rank) : k(k), rank(rank) {}
    bool operator()(int i, int j){
        if(rank[i] != rank[j]) return rank[i] < rank[j];
        else return rank[i + k] < rank[j + k];
    }
};

//Assume A[i]>=0
vector<int> construct_sa(vector<int> A){
    int N = A.size();
    vector<int> sa(N + 1), rank(N + 1), tmp(N + 1);
    for(int i = 0; i <= N; i++){
        sa[i] = i;
        rank[i] = i < N ? A[i] : -1;
    }
    for(int k = 1; k <= N; k *= 2){
        Compare_sa comp(k, rank);
        sort(sa.begin(), sa.end(), comp);
        tmp[sa[0]] = 0;
        for(int i = 1; i <= N; i++) tmp[sa[i]] = tmp[sa[i - 1]] + (comp(sa[i - 1], sa[i]) ? 1 : 0);
        rank.swap(tmp);
    }
    return sa;
}

vector<int> construct_sa(string S){
    int N = S.size();
    vector<int> A(N);
    for(int i = 0; i < N; i++) A[i] = (int)S[i];
    return construct_sa(A);
}

vector<int> construct_lcp(vector<int> A, vector<int> sa){
    int N = A.size();
    vector<int> lcp(N), rank(N + 1);
    for(int i = 0; i <= N; i++) rank[sa[i]] = i;

    int h = 0;
    lcp[0] = 0;
    for(int i = 0; i < N; i++){
        int j = sa[rank[i] - 1];

        if(h > 0) h--;
        for(; j + h < N && i + h < N; h++){
            if(A[j + h] != A[i + h]) break;
        }

        lcp[rank[i] - 1] = h;
    }
    return lcp;
}

vector<int> construct_lcp(string S, vector<int> sa){
    int N = S.size();
    vector<int> A(N);
    for(int i = 0; i < N; i++) A[i] = (int)S[i];
    return construct_lcp(A, sa);
}


signed main(){

    string S; cin >> S;
    int N = SZ(S);
    vec sa = construct_sa(S);
    vec lcp = construct_lcp(S, sa);

    int ans = 0;
    FOR(i, 1, N){
        ans += N - sa[i] - lcp[i];
    }
    ans += N - sa[N];
    Out(ans);

    return 0;
}


Measured memory_bytes: 31312