#include <bits/stdc++.h>
using namespace std;
struct state {
  int link, go[26], max_l;
  bool term, used;
  long long ans, sum;
  int &operator[](int ind) { return go[ind]; }
};
const int max_l = 1000000;
state states[max_l];
char s[max_l];
int last = 0, freeS = 1;
void extend(int c) {
  int add = freeS++;
  memset(states[add].go, -1, sizeof(states[add].go));
  states[add].max_l = states[last].max_l + 1;
  int i = last;
  while ((i != -1) && (states[i][c] == -1))
    states[i][c] = add, i = states[i].link;
  if (i == -1)
    states[add].link = 0;
  else {
    int q = states[i][c];
    if (states[q].max_l == states[i].max_l + 1)
      states[add].link = q;
    else {
      int clone = freeS++;
      states[clone] = states[q];
      states[clone].max_l = states[i].max_l + 1;
      while ((i != -1) && (states[i][c] == q))
        states[i][c] = clone, i = states[i].link;
      states[q].link = states[add].link = clone;
    }
  }
  last = add;
}
long long dfs(int v) {
  if (states[v].used) return states[v].sum;
  states[v].used = true;
  states[v].ans = (int)states[v].term;
  states[v].sum = 0;
  for (int c = 0; c < 26; ++c)
    if (states[v][c] != -1) {
      states[v].sum += dfs(states[v][c]);
      states[v].ans += states[states[v][c]].ans;
    }
  states[v].sum +=
      (v == 0) ? 0 : (states[v].ans * 1ll * (states[v].ans + 1)) / 2;
  return states[v].sum;
}
int main() {
  memset(states[0].go, -1, sizeof(states[0].go));
  states[0].max_l = 0;
  states[0].link = -1;
  scanf("%s", s);
  int n = strlen(s);
  for (int i = 0; i < n; ++i) extend(s[i] - 'a');
  while (last != 0) {
    states[last].term = true;
    last = states[last].link;
  }
  cout << dfs(0) << endl;
  return 0;
}
