#include <iostream>
#include <string>
#include <vector>
#include <array>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <cassert>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

//A[i] := S[0:i]のsuffix, prefixで最大何文字一致するか
vector<int> MP(const string& S){
  int N = S.size();
  vector<int> A(N+1), ret(N);
  A[0] = -1;
  int j = -1;
  for(int i=0;i<N;i++){
  while(j>=0&&S[i]!=S[j]) j = A[j];
  j++;
  A[i+1] = ret[i] = j;
  }
  return ret;
}

//S[i]を中心とする最大回文半径
//偶数文字の回文を検出したい場合中心が無いため$を挟む必要がある
vector<int> manacher(const string &s){
  int n = s.size(), c = 0;
  vector<int> rad(n);
  for(int r=0;r<n;r++){
  int l = c - (r - c);
  if(r + rad[l] < c + rad[c]) rad[r] = rad[l];
  else{
    int rr = c + rad[c];
    int rl = r - (rr - r);
    while(rl >= 0 && rr < n && s[rl] == s[rr]) rr++, rl--;
    rad[r] = rr - r;
    c = r;
  }
  }
  return rad;
}

string insert_dollar(const string &s){
  int n = s.size();
  string ret(n*2+1, '$');
  for(int i=0;i<n;i++) ret[i*2+1] = s[i];
  return ret;
}

bool is_palindrome(int l, int r, const vector<int> &rad){
  l = l * 2 + 1;
  r = (r - 1 ) * 2 + 1;
  int c = (l + r ) / 2;
  return r < c + rad[c];
}

#include <numeric>
vector<int> sa_naive(const vector<int>& s) {
  int n = int(s.size());
  vector<int> sa(n);
  iota(sa.begin(), sa.end(), 0);
  sort(sa.begin(), sa.end(), [&](int l, int r) {
    if (l == r) return false;
    while (l < n && r < n) {
      if (s[l] != s[r]) return s[l] < s[r];
      l++;
      r++;
    }
    return l == n;
  });
  return sa;
}

vector<int> sa_doubling(const vector<int>& s) {
  int n = int(s.size());
  vector<int> sa(n), rnk = s, tmp(n);
  iota(sa.begin(), sa.end(), 0);
  for (int k = 1; k < n; k *= 2) {
    auto cmp = [&](int x, int y) {
      if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];
      int rx = x + k < n ? rnk[x + k] : -1;
      int ry = y + k < n ? rnk[y + k] : -1;
      return rx < ry;
    };
    sort(sa.begin(), sa.end(), 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]) ? 1 : 0);
    }
    swap(tmp, rnk);
  }
  return sa;
}

// SA-IS, linear-time suffix array construction
// Reference:
// G. Nong, S. Zhang, and W. H. Chan,
// Two Efficient Algorithms for Linear Time Suffix Array Construction
template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>
vector<int> sa_is(const vector<int>& s, int upper) {
  int n = int(s.size());
  if (n == 0) return {};
  if (n == 1) return {0};
  if (n == 2) {
    if (s[0] < s[1]) {
      return {0, 1};
    } else {
      return {1, 0};
    }
  }
  if (n < THRESHOLD_NAIVE) {
    return sa_naive(s);
  }
  if (n < THRESHOLD_DOUBLING) {
    return sa_doubling(s);
  }

  vector<int> sa(n);
  vector<bool> ls(n);
  for (int i = n - 2; i >= 0; i--) {
    ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);
  }
  vector<int> sum_l(upper + 1), sum_s(upper + 1);
  for (int i = 0; i < n; i++) {
    if (!ls[i]) {
      sum_s[s[i]]++;
    } else {
      sum_l[s[i] + 1]++;
    }
  }
  for (int i = 0; i <= upper; i++) {
    sum_s[i] += sum_l[i];
    if (i < upper) sum_l[i + 1] += sum_s[i];
  }

  auto induce = [&](const vector<int>& lms) {
    fill(sa.begin(), sa.end(), -1);
    vector<int> buf(upper + 1);
    copy(sum_s.begin(), sum_s.end(), buf.begin());
    for (auto d : lms) {
      if (d == n) continue;
      sa[buf[s[d]]++] = d;
    }
    copy(sum_l.begin(), sum_l.end(), buf.begin());
    sa[buf[s[n - 1]]++] = n - 1;
    for (int i = 0; i < n; i++) {
      int v = sa[i];
      if (v >= 1 && !ls[v - 1]) {
        sa[buf[s[v - 1]]++] = v - 1;
      }
    }
    copy(sum_l.begin(), sum_l.end(), buf.begin());
    for (int i = n - 1; i >= 0; i--) {
      int v = sa[i];
      if (v >= 1 && ls[v - 1]) {
        sa[--buf[s[v - 1] + 1]] = v - 1;
      }
    }
  };

  vector<int> lms_map(n + 1, -1);
  int m = 0;
  for (int i = 1; i < n; i++) {
    if (!ls[i - 1] && ls[i]) {
      lms_map[i] = m++;
    }
  }
  vector<int> lms;
  lms.reserve(m);
  for (int i = 1; i < n; i++) {
    if (!ls[i - 1] && ls[i]) {
      lms.push_back(i);
    }
  }

  induce(lms);

  if (m) {
    vector<int> sorted_lms;
    sorted_lms.reserve(m);
    for (int v : sa) {
      if (lms_map[v] != -1) sorted_lms.push_back(v);
    }
    vector<int> rec_s(m);
    int rec_upper = 0;
    rec_s[lms_map[sorted_lms[0]]] = 0;
    for (int i = 1; i < m; i++) {
      int l = sorted_lms[i - 1], r = sorted_lms[i];
      int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;
      int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;
      bool same = true;
      if (end_l - l != end_r - r) {
        same = false;
      } else {
        while (l < end_l) {
          if (s[l] != s[r]) {
            break;
          }
          l++;
          r++;
        }
        if (l == n || s[l] != s[r]) same = false;
      }
      if (!same) rec_upper++;
      rec_s[lms_map[sorted_lms[i]]] = rec_upper;
    }

    auto rec_sa = sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);

    for (int i = 0; i < m; i++) sorted_lms[i] = lms[rec_sa[i]];
    induce(sorted_lms);
  }
  return sa;
}


vector<int> suffix_array(const vector<int>& s, int upper) {
  assert(0 <= upper);
  for (int d : s) assert(0 <= d && d <= upper);
  auto sa = sa_is(s, upper);
  return sa;
}

template <class T> vector<int> suffix_array(const vector<T>& s) {
  int n = int(s.size());
  vector<int> idx(n);
  iota(idx.begin(), idx.end(), 0);
  sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });
  vector<int> s2(n);
  int now = 0;
  for (int i = 0; i < n; i++) {
    if (i && s[idx[i - 1]] != s[idx[i]]) now++;
    s2[idx[i]] = now;
  }
  return sa_is(s2, now);
}

vector<int> suffix_array(const string& s) {
  int n = int(s.size());
  vector<int> s2(n);
  for (int i = 0; i < n; i++) s2[i] = s[i];
  return sa_is(s2, 255);
}

// Reference:
// T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park,
// Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its
// Applications
template <class T>
vector<int> lcp_array(const vector<T>& s, const vector<int>& sa) {
  int n = int(s.size());
  assert(n >= 1);
  vector<int> rnk(n);
  for (int i = 0; i < n; i++) rnk[sa[i]] = i;
  vector<int> lcp(n - 1);
  int h = 0;
  for (int i = 0; i < n; i++) {
    if (h > 0) h--;
    if (rnk[i] == 0) continue;
    int 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;
}

vector<int> lcp_array(const string& s, const vector<int>& sa) {
  int n = int(s.size());
  vector<int> s2(n);
  for (int i = 0; i < n; i++) s2[i] = s[i];
  return lcp_array(s2, sa);
}

vector<int> rank_array(const vector<int>& sa){
  int n = (int)sa.size();
  vector<int> rank(n);
  for(int i=0;i<n;i++) rank[sa[i]] = i;
  return rank;
}

void sa_debug(const string& s){
  vector<int> sa = suffix_array(s);
  vector<int> lcp = lcp_array(s, sa);
  int n = (int)s.size();
  for(int i=0;i<n;i++) std::cout << s.substr(sa[i]) << " " << lcp[i] << '\n';
}


/*DOCUMENT
  vector<int> suffix_array(string)
  vector<int> lcp_array(string)
  vector<int> lcp_array(string, sa)
  vector<int> rank_array(sa)
  void sa_debug(string)

  lcp: 次の接尾辞と一致する文字数
  rank: S[i:n]が接尾辞配列で何番目に位置するか

  lcp(i, j)(S[i:n], S[j:n]で一致する文字数)を求めたい場合は
  l = min(rank[i], rank[j])
  r = max(rank[i], rank[j]) として[l, r)のlcpのminを取ればいい
  l==rの場合は N - i
*/

void print(vector<int> v){
  int N = v.size();
  for(int i=0;i<N;i++){
  if(i!=N-1) printf("%d ", v[i]);
  else printf("%d\n", v[i]);
  }
}

int main(){
  string s;cin >> s;
  //sa_debug(s);
  auto sa = suffix_array(s);
  auto lcp = lcp_array(s, sa);
  auto rank = rank_array(sa);
  ll n = s.size();
  ll ans = (n*(n+1))/2;
  ll S = 0;
  for(auto e:lcp) S += e;
  std::cout << ans - S << '\n';
}


Measured memory_bytes: 15660