#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int SIGMA = 26;

struct Node {
  Node *child[SIGMA];
  Node *fail;
  int len, cnt;
};

const int N = 1e6 + 10;
Node pool[N << 1], *last, *head;

Node *new_node(int len) {
  Node *p = last++;
  p->len = len;
  p->cnt = 0;
  fill(p->child, p->child + SIGMA, (Node *)nullptr);
  p->fail = nullptr;
  return p;
}

Node* add(int c, Node* p) {
  Node *np = new_node(p->len + 1);
  np->cnt = 1;
  for (; p && !p->child[c]; p = p->fail) {
    p->child[c] = np;
  }
  if (!p) {
    np->fail = head;
  } else {
    Node *q = p->child[c];
    if (q->len == p->len + 1) {
      np->fail = q;
    } else {
      Node *r = last++;
      copy(q->child, q->child + SIGMA, r->child);
      r->fail = q->fail;
      r->cnt = 0;
      r->len = p->len + 1;
      np->fail = q->fail = r;
      for (; p && p->child[c] == q; p = p->fail) {
        p->child[c] = r;
      }
    }
  }
  return np;
}

int main() {
  string s;
  cin >> s;
  last = pool;
  head = new_node(0);
  Node* p = head;
  for (auto& c : s) p = add(c - 'a', p);

  vector<vector<Node*>> bucket(last - pool);
  for (Node* p = head + 1; p != last; ++p) {
    bucket[p->len].push_back(p);
  }
  int64 ret = 0;
  for (int i = SZ(bucket) - 1; i > 0; --i) {
    for (auto* p : bucket[i]) {
      if (p->cnt > 0) ret += p->len - p->fail->len;
      p->fail->cnt += p->cnt;
    }
  }
  cout << ret << '\n';
  return 0;
}


Measured memory_bytes: 213396