#include<bits/stdc++.h>

#define ll long long
#define pp push_back
#define endl '\n'
#define all(x) x.begin(),x.end()
#define ld long double
#define PI acos(-1)
#define sin(a) sin((a)*PI/180)
#define cos(a) cos((a)*PI/180)
#define ones(x) __builtin_popcountll(x)
//#define int ll

using namespace std;

void Drakon() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

unsigned long long inf = 1e10;
const double EPS = 1e-6;
const int MOD = 9302023, N = 1e6 + 5, LOG = 25;

ll mul(const ll &a, const ll &b) {
    return (a % MOD + MOD) * (b % MOD + MOD) % MOD;
}

ll add(const ll &a, const ll &b) {
    return (a + b + 2 * MOD) % MOD;
}

ll pw(ll x, ll y) {
    ll ret = 1;
    while (y > 0) {
        if (y % 2 == 0) {
            x = mul(x, x);
            y = y / 2;
        } else {
            ret = mul(ret, x);
            y = y - 1;
        }
    }
    return ret;
}

string s;
vector<string>digits;
int n;
pair<int, int>dp[N];

pair<int, int> slv(int i){
    if(i == n){
        return {0, 1};
    }

    pair<int, int> &ret = dp[i];
    if(~ret.first)
        return ret;
    ret = {0, 1};
    for(auto x : digits){
        if(i + x.size() - 1 < n && s.substr(i, x.size()) == x){
            pair<int, int>cur = slv(i + x.size());
            cur.first += x.size() - 1;
            if(cur.first > ret.first){
                ret = cur;
            }
            else if(cur.first == ret.first){
                ret.second = add(ret.second, cur.second);
            }
        }
    }

    pair<int, int>cur = slv(i + 1);
    if(cur.first > ret.first){
        ret = cur;
    }
    else if(cur.first == ret.first){
        ret.second = add(ret.second, cur.second);
    }
    if(ret.first == 0)ret.second = 1;
    return ret;
}

void solve() {
    cin >> s;
    n = s.size();
    digits = {"zero", "one", "two", "three",
    "four", "five", "six", "seven", "eight", "nine"};

    for (int i = 0; i < N; ++i) {
        dp[i] = {-1, -1};
    }
    cout << n - slv(0).first << endl << slv(0).second;
}

signed main() {
    Drakon();
    int t = 1;
    //cin >> t;
    while (t--) {
        solve();
    }
}