#include <bits/stdc++.h>
using namespace std;
struct SuffixAutomaton {
  vector<unordered_map<char, int> > edges;
  vector<int> link;
  vector<int> length;
  vector<bool> terminal;
  int last;
  SuffixAutomaton() {}
  SuffixAutomaton(string s) {
    edges.push_back({});
    link.push_back(-1);
    length.push_back(0);
    last = 0;
    for (int i = 0; i < s.size(); i++) {
      edges.push_back({});
      length.push_back(i + 1);
      link.push_back(0);
      int r = edges.size() - 1;
      int p = last;
      while (p >= 0 && edges[p][s[i]] == 0) {
        edges[p][s[i]] = r;
        p = link[p];
      }
      if (p != -1) {
        int q = edges[p][s[i]];
        if (length[p] + 1 == length[q]) {
          link[r] = q;
        } else {
          edges.push_back(edges[q]);
          length.push_back(length[p] + 1);
          link.push_back(link[q]);
          int qq = edges.size() - 1;
          link[q] = qq;
          link[r] = qq;
          while (p >= 0 && edges[p][s[i]] == q) {
            edges[p][s[i]] = qq;
            p = link[p];
          }
        }
      }
      last = r;
    }
    terminal.resize(edges.size());
    int p = last;
    while (p > 0) {
      terminal[p] = true;
      p = link[p];
    }
  }
} sa;
long long dp[200010];
long long sol(int node) {
  long long &ans = dp[node];
  if (ans != -1) return ans;
  ans = 0;
  if (sa.terminal[node]) ans++;
  for (pair<char, int> i : sa.edges[node])
    if (i.second != 0) ans += sol(i.second);
  return ans;
}
void printsa() {
  for (int i = 0; i < sa.edges.size(); i++) {
    for (pair<char, int> j : sa.edges[i]) {
      cout << i << " " << j.second << " " << j.first << endl;
    }
  }
  for (int i = 0; i < sa.edges.size(); i++) {
    if (sa.terminal[i]) cout << i << endl;
  }
  for (int i = 0; i < sa.edges.size(); i++) {
    cout << i << " suf-link " << sa.link[i] << endl;
  }
  cout << "last " << sa.last << endl;
}
long long solve() {
  long long ans = 0;
  for (int i = 1; i < sa.edges.size(); i++) {
    long long c = sol(i);
    long long c1 = sa.length[i] - sa.length[sa.link[i]];
    long long aux = c * (c + 1);
    aux = aux / 2;
    ans += aux * c1;
  }
  return ans;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  string s;
  cin >> s;
  sa = SuffixAutomaton(s);
  memset(dp, -1, sizeof dp);
  cout << solve() << endl;
  return 0;
}
