using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using System.Threading;
using System.Runtime.CompilerServices;
using System.Text;
using System.Diagnostics;
using System.Numerics;
using static System.Console;
using static System.Convert;
using static System.Math;
using static Template;
using SC = Scanner;

public partial class Solver
{
    public void Solve()
    {
        var S = sc.Str;
        var res = (long)S.Length * (S.Length + 1) / 2;
        var lcp = ALC_String.LCPArray(S, ALC_String.SuffixArray(S));
        Console.WriteLine(res-lcp.Aggregate(0L,(a,b)=>a+b));
    }
}
static class ALC_String
{
    public static int[] SuffixArray(string S) => SA_IS(S.Select(v => (int)v).ToArray(), 255);
    public static int[] SuffixArray(int[] S)
    {
        var idx = Enumerable.Range(0, S.Length).ToArray();
        Array.Sort(idx, (l, r) => S[l].CompareTo(S[r]));
        var S2 = new int[S.Length];
        var now = 0;
        for(int i = 0; i < idx.Length; i++)
        {
            if (i > 0 && S[idx[i - 1]] != S[idx[i]]) now++;
            S2[idx[i]] = now;
        }
        return SA_IS(S2, now);
    }
    public static int[] LCPArray(string S, int[] SA) => LCPArray(S.Select(v => (int)v).ToArray(), SA);
    public static int[] LCPArray(int[] S,int[] SA)
    {
        var N = S.Length;
        var rnk = new int[N];
        for (int i = 0; i < SA.Length; i++) rnk[SA[i]] = i;
        var lcp = new int[N - 1];
        var h = 0;
        for(int i = 0; i < rnk.Length; i++)
        {
            if (h > 0) h--;
            if (rnk[i] == 0) continue;
            var j = SA[rnk[i] - 1];
            for (; j + h < N && i + h < N; h++) if (S[j + h] != S[i + h]) break;
            lcp[rnk[i] - 1] = h;
        }
        return lcp;
    }
    static int[] SA_IS(int[] S, int upper)
    {
        var N = S.Length;
        if (N == 1) return new[] { 0 };
        if (N == 2) { if (S[0] < S[1]) return new[] { 0, 1 }; else return new[] { 1, 0 }; }
        if (N < 10) return SAnaive(S);
        if (N < 40) return SAdoubling(S);
        var SA = new int[N];
        var ls = new bool[N];
        for (int i = S.Length - 2; i >= 0; i--) ls[i] = (S[i] == S[i + 1]) ? ls[i + 1] : (S[i] < S[i + 1]);
        int[] sumL = new int[upper + 1], sumS = new int[upper + 1];
        for (int i = 0; i < ls.Length; i++)
        {
            if (!ls[i]) sumS[S[i]]++;
            else sumL[S[i] + 1]++;
        }
        for (int i = 0; i <= upper; i++)
        {
            sumS[i] += sumL[i];
            if (i < upper) sumL[i + 1] += sumS[i];
        }

        Action<int[]> induce = null;
        induce = lm =>
        {
            for (int i = 0; i < SA.Length; i++) SA[i] = -1;
            var buf = new int[upper + 1];
            Array.Copy(sumS, buf, sumS.Length);
            foreach (var d in lm)
            {
                if (d == N) continue;
                SA[buf[S[d]]++] = d;
            }
            Array.Copy(sumL, buf, sumL.Length);
            SA[buf[S[N - 1]]++] = N - 1;
            for(int i = 0; i < SA.Length; i++)
            {
                var v = SA[i];
                if (v >= 1 && !ls[v - 1]) SA[buf[S[v - 1]]++] = v - 1;
            }
            Array.Copy(sumL, buf, sumL.Length);
            for (int i = SA.Length - 1; i >= 0; i--)
            {
                var v = SA[i];
                if (v >= 1 && ls[v - 1]) SA[--buf[S[v - 1] + 1]] = v - 1;
            }
        };
        var lmsMap = new int[N + 1];
        for (int i = 0; i < lmsMap.Length; i++) lmsMap[i] = -1;
        var m = 0;
        for (int i = 1; i < ls.Length; i++) if (!ls[i - 1] && ls[i]) lmsMap[i] = m++;
        var lms = new int[m];var tp = 0;
        for(int i = 1; i <ls.Length; i++) if (!ls[i - 1] && ls[i]) lms[tp++] = i;
        induce(lms);
        if (m > 0)
        {
            tp = 0;
            var sortedLms = new int[m];
            foreach (var v in SA) if (lmsMap[v] != -1) sortedLms[tp++] = v;
            var recS = new int[m];
            var recUpper = 0;
            recS[lmsMap[sortedLms[0]]] = 0;
            for(int i = 1; i < m; i++)
            {
                int l = sortedLms[i - 1], r = sortedLms[i];
                int endl = (lmsMap[l] + 1 < m) ? lms[lmsMap[l] + 1] : N;
                int endr = (lmsMap[r] + 1 < m) ? lms[lmsMap[r] + 1] : N;
                var same = true;
                if (endl - l != endr - r)
                {
                    same = false;
                }
                else
                {
                    while (l < endl)
                    {
                        if (S[l] != S[r]) break;
                        l++;r++;
                    }
                    if (l == N || S[l] != S[r]) same = false;
                }
                if (!same) recUpper++;
                recS[lmsMap[sortedLms[i]]] = recUpper;
            }
            var recSA = SA_IS(recS, recUpper);
            for (int i = 0; i < sortedLms.Length; i++) sortedLms[i] = lms[recSA[i]];
            induce(sortedLms);
        }
        return SA;
    }
    static int[] SAnaive(int[] S)
    {
        var SA = Enumerable.Range(0, S.Length).ToArray();
        Array.Sort(SA, (l, r) =>
        {
            if (l == r) return 0;
            while (l < S.Length && r < S.Length)
            {
                if (S[l] != S[r]) return S[l].CompareTo(S[r]);
                l++;r++;
            }
            return l == S.Length ? -1 : 0;
        });
        return SA;
    }
    static int[] SAdoubling(int[] S)
    {
        int N = S.Length;
        var SA = Enumerable.Range(0, N).ToArray();
        var rnk = S.ToArray();
        var tmp = new int[N];
        for(int k = 1; k < N; k <<= 1)
        {
            Comparison<int> cmp = null;
            cmp = (x, y) =>
            {
                if (rnk[x] != rnk[y]) return rnk[x].CompareTo(rnk[y]);
                int rx = x + k < N ? rnk[x + k] : -1;
                int ry = y + k < N ? rnk[y + k] : -1;
                return rx.CompareTo(ry);
            };
            Array.Sort(SA, cmp);
            tmp[SA[0]] = 0;
            for(int i = 1; i < N; i++)
            {
                tmp[SA[i]] = tmp[SA[i - 1]] + (cmp(SA[i - 1], SA[i]) >= 0 ? 0 : 1);
            }
            swap(ref tmp, ref rnk);
        }
        return SA;
    }
}
#region Template
public partial class Solver
{
    public SC sc = new SC();
    static void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        var sol = new Solver();
        int testcase = 1;
        //testcase = sol.sc.Int;
        //var th = new Thread(sol.Solve, 1 << 26);th.Start();th.Join();
        while (testcase-- > 0)
            sol.Solve();
        Console.Out.Flush();
    }
}
public static class Template
{
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) > 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(ref T a, ref T b) { var t = b; b = a; a = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static void swap<T>(this IList<T> A, int i, int j) { var t = A[i]; A[i] = A[j]; A[j] = t; }
    public static T[] Create<T>(int n, Func<T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(); return rt; }
    public static T[] Create<T>(int n, Func<int, T> f) { var rt = new T[n]; for (var i = 0; i < rt.Length; ++i) rt[i] = f(i); return rt; }
    public static void Out<T>(this IList<T> A, out T a) => a = A[0];
    public static void Out<T>(this IList<T> A, out T a, out T b) { a = A[0]; b = A[1]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c) { A.Out(out a, out b); c = A[2]; }
    public static void Out<T>(this IList<T> A, out T a, out T b, out T c, out T d) { A.Out(out a, out b, out c); d = A[3]; }
    public static string Concat<T>(this IEnumerable<T> A, string sp) => string.Join(sp, A);
    public static char ToChar(this int s, char begin = '0') => (char)(s + begin);
    public static IEnumerable<T> Shuffle<T>(this IEnumerable<T> A) => A.OrderBy(v => Guid.NewGuid());
    public static int CompareTo<T>(this T[] A, T[] B, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; for (var i = 0; i < Min(A.Length, B.Length); i++) { int c = cmp(A[i], B[i]); if (c > 0) return 1; else if (c < 0) return -1; } if (A.Length == B.Length) return 0; if (A.Length > B.Length) return 1; else return -1; }
    public static string ToStr<T>(this T[][] A) => A.Select(a => a.Concat(" ")).Concat("\n");
    public static int ArgMax<T>(this IList<T> A, Comparison<T> cmp = null) { cmp = cmp ?? Comparer<T>.Default.Compare; T max = A[0]; int rt = 0; for (int i = 1; i < A.Count; i++) if (cmp(max, A[i]) < 0) { max = A[i]; rt = i; } return rt; }
    public static T PopBack<T>(this List<T> A) { var v = A[A.Count - 1]; A.RemoveAt(A.Count - 1); return v; }
    public static void Fail<T>(T s) { Console.WriteLine(s); Console.Out.Close(); Environment.Exit(0); }
}
public class Scanner
{
    public string Str => Console.ReadLine().Trim();
    public int Int => int.Parse(Str);
    public long Long => long.Parse(Str);
    public double Double => double.Parse(Str);
    public int[] ArrInt => Str.Split(' ').Select(int.Parse).ToArray();
    public long[] ArrLong => Str.Split(' ').Select(long.Parse).ToArray();
    public char[][] Grid(int n) => Create(n, () => Str.ToCharArray());
    public int[] ArrInt1D(int n) => Create(n, () => Int);
    public long[] ArrLong1D(int n) => Create(n, () => Long);
    public int[][] ArrInt2D(int n) => Create(n, () => ArrInt);
    public long[][] ArrLong2D(int n) => Create(n, () => ArrLong);
    private Queue<string> q = new Queue<string>();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public T Next<T>() { if (q.Count == 0) foreach (var item in Str.Split(' ')) q.Enqueue(item); return (T)Convert.ChangeType(q.Dequeue(), typeof(T)); }
    public void Make<T1>(out T1 v1) => v1 = Next<T1>();
    public void Make<T1, T2>(out T1 v1, out T2 v2) { v1 = Next<T1>(); v2 = Next<T2>(); }
    public void Make<T1, T2, T3>(out T1 v1, out T2 v2, out T3 v3) { Make(out v1, out v2); v3 = Next<T3>(); }
    public void Make<T1, T2, T3, T4>(out T1 v1, out T2 v2, out T3 v3, out T4 v4) { Make(out v1, out v2, out v3); v4 = Next<T4>(); }
    public void Make<T1, T2, T3, T4, T5>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5) { Make(out v1, out v2, out v3, out v4); v5 = Next<T5>(); }
    public void Make<T1, T2, T3, T4, T5, T6>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6) { Make(out v1, out v2, out v3, out v4, out v5); v6 = Next<T6>(); }
    public void Make<T1, T2, T3, T4, T5, T6, T7>(out T1 v1, out T2 v2, out T3 v3, out T4 v4, out T5 v5, out T6 v6, out T7 v7) { Make(out v1, out v2, out v3, out v4, out v5, out v6); v7 = Next<T7>(); }
    public (T1, T2) Make<T1, T2>() { Make(out T1 v1, out T2 v2); return (v1, v2); }
    public (T1, T2, T3) Make<T1, T2, T3>() { Make(out T1 v1, out T2 v2, out T3 v3); return (v1, v2, v3); }
    public (T1, T2, T3, T4) Make<T1, T2, T3, T4>() { Make(out T1 v1, out T2 v2, out T3 v3, out T4 v4); return (v1, v2, v3, v4); }
}

#endregion

Measured memory_bytes: 49832