#include <iostream>
#include <set>
#include <unordered_map>

using namespace std;

int main()
{
    string input = "";
    while (cin >> input)
    {
        int l = 0, r = 0;
        set<char> Char(input.begin(), input.end()); // set for size
        unordered_map<char, int> occ;               // hashmap check how many times char occurs
        unordered_map<string, int> Appeared;        // hashmap to keep track of repeating substrings

        int s = Char.size(); // value to compare to
        int curr = 0;        // how many unique chars are within window
        int occurance = 0;   // return value
        while (l <= r)
        {
            // if we reached end, break
            if (r == input.length())
                break;
            // if we haven't seen char yet, increment unique curr within sliding window
            if (occ[input[r]] == 0)
                curr++;

            occ[input[r]]++; // increment occurence within occ hashmap

            if (curr == s)
            {
                // check left pointer
                // if char already exists within window, increment l
                while (occ[input[l]] > 1)
                {
                    occ[input[l]]--;
                    l++;
                }
                // put the substring within Appeared hashmap to keep track of substrings
                string sub = "";
                for (int i = l; i <= r; i++)
                {
                    sub += input[i];
                }

                // cout << sub << endl;

                Appeared[sub]++;

                // if it appears more then once, dont increment occurances
                if (Appeared[sub] == 1)
                {
                    if (input.length() != curr)
                    {
                        occurance++;

                        // we have optimal window
                        curr--;
                        occ[input[l]] = 0;
                        l++;
                    }
                    // we breakout if the valid substring is the size of string
                    else
                        break;
                }
                else
                {
                    curr--;
                    occ[input[l]] = 0;
                    l++;
                }
            }
            r++;
        }
        cout << occurance << endl;
    }
    return 0;
}