1590

#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <unordered_map>
using namespace std;


string s;
unsigned long long int n, p = 13773, m = 33000123, chet = 0;
vector <unsigned long long int> pow, rh;
vector <bool> dd(m + 1, false);

int main()
{
    cin >> s;

    n = s.size();
    pow.resize(n);
    rh.resize(n + 1);

    pow[0] = 1;
    for (int i = 1; i < n; i++) {
        pow[i] = (pow[i - 1] * p) % m;
    }

    rh[0] = 0;
    for(int i = 1; i <= n; i++){
        rh[i] = rh[i - 1] + (s[i - 1] * pow[i - 1]) % m;
    }

    for (int i = 0; i < n; i++) {
        unordered_map <unsigned int, bool> gg;

        for(int j = 0; j < n - i; j++){
            unsigned long long int h = ((rh[j + i + 1] - rh[j]) * pow[n - j - 1]) % m;
            dd[h] = true;
        }
    }

    for(int i = 0; i < m + 1; i++){
        if (dd[i]){
            chet++;
        }
    }

    cout << chet;
}