#include <bits/stdc++.h>
using namespace std;
struct SAM {
  SAM(void) {
    lst = tot = 0;
    memset(t->ch, 0xff, 26 << 2);
    t->fa = -1, t->len = 0;
  }
  struct SAMnode {
    int ch[26], fa, len;
  } t[(100005) << 1];
  int lst, tot, ind[(100005) << 1], q[(100005) << 1], Head, Tail,
      siz[(100005) << 1];
  void append(int c) {
    int p = lst, np = lst = ++tot;
    siz[np] = 1;
    memset(t[np].ch, 0xff, 26 << 2);
    t[np].len = t[p].len + 1;
    while (~p && !~t[p].ch[c]) t[p].ch[c] = np, p = t[p].fa;
    if (~p) {
      int q = t[p].ch[c];
      if (t[p].len + 1 == t[q].len) {
        t[np].fa = q;
      } else {
        int nq = ++tot;
        t[nq] = t[q];
        t[nq].len = t[p].len + 1;
        t[q].fa = t[np].fa = nq;
        while (~p && t[p].ch[c] == q) t[p].ch[c] = nq, p = t[p].fa;
      }
    } else {
      t[np].fa = 0;
    }
  }
  void solve(void) {
    memset(ind, 0, (tot + 1) << 2);
    for (int i = 1; i <= tot; ++i) ++ind[t[i].fa];
    Head = Tail = 0;
    for (int i = 1; i <= tot; ++i)
      if (!ind[i]) q[Tail++] = i;
    long long res(0);
    while (Head < Tail) {
      int x = q[Head++];
      if (x) {
        siz[t[x].fa] += siz[x];
        if (!--ind[t[x].fa]) q[Tail++] = t[x].fa;
        res += (long long)(t[x].len - t[t[x].fa].len) *
               ((long long)siz[x] * (siz[x] + 1) >> 1);
      }
    }
    cout << res << endl;
  }
} sam;
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  char c;
  while (cin >> c) sam.append(c - 'a');
  sam.solve();
  return 0;
}
