N2

#include <iostream>
#include <cmath>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
#include <stack>
#include <set>
#include <map>
#define pii pair <int, int>
#define pb(x) push_back(x)
using namespace std;
using ll = long long;
using ld = long double;
using db = double;
void cv(vector <int> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}

void cvl(vector <ll> &v) {
    for (auto x : v) cout << x << ' ';
    cout << "\n";
}


void cvv(vector <vector <int> > &v) {
    for (auto x : v) cv(x);
    cout << "\n";
}

void cvb(vector <bool> v) {
    for (bool x : v) cout << x << ' ';
    cout << "\n";
}

void cvs(vector <string>  v) {
    for (auto a : v) {
        cout << a << "\n";
    }
}

void cvp(vector <pii> a) {
    for (auto p : a) {
        cout << p.first << ' ' << p.second << "\n";
    }
    cout << "\n";
}



int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    string s;
    cin >> s;
    reverse(s.begin(), s.end());
    ll x = 0;
    bool sh = 0;
    int n = s.size();
    set <char> a, b;
    for (int i = 0; i < n; ++i) {
        x += (s[i] - '0') * pow(5, i);
        a.insert(s[i]);
    }
    string t = to_string(x);
    for (char k: t) {
        if (a.find(k) == a.end()) {
            b.insert(k);
        }
    }
    if (sh) {
        cout << "see\n";
        cout << s << ' ' << x << ' ' << t << "\n";
        cout << "a\n";
        for (char k: a) {
            cout << k << ' ' ;
        }
        cout << "\nb\n";
        for (char k: b) {
            cout << k << ' ' ;
        }
        cout << "\n";
    }
    cout << b.size();
}