#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <string>
#include <map>
using namespace std;
typedef long long ll;

map<string, char> digitMap = {
    {"zero", '0'}, {"one", '1'}, {"two", '2'}, {"three", '3'}, {"four", '4'},
    {"five", '5'}, {"six", '6'}, {"seven", '7'}, {"eight", '8'}, {"nine", '9'}
};

set<string> findMinStrings(string a) {
    set<string> results;
    bool replaced = false;
    

    for (auto &pair : digitMap) {
        string word = pair.first;
        size_t pos = a.find(word);
        if (pos != string::npos) {
            replaced = true;
            string newStr = a.substr(0, pos) + pair.second + a.substr(pos + word.size());
           
            set<string> subResults = findMinStrings(newStr);
            results.insert(subResults.begin(), subResults.end());
        }
    }

    // If no replacement was made, the current string is a final result
    if (!replaced) {
        results.insert(a);
    }

    return results;
}

int main() {
    string a;
    cin >> a;


    set<string> minStrings = findMinStrings(a);


    if (!minStrings.empty()) {
        cout << (*minStrings.begin()).size() << "\n";  
        cout << minStrings.size() << "\n";  
    } else {

        cout << a.size() << "\n";
        cout << 1 << "\n";  
    }

    return 0;
}