#include <bits/stdc++.h>
#define MayaZayn ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);
#define ll long long
#define endl '\n'
#define all(x) (x).begin(), (x).end()
#define all_r(x) (x).rbegin(), (x).rend()
#define mnEl(vec) *min_element(vec.begin(), vec.end())
#define mxEl(vec) *max_element(vec.begin(), vec.end())
#define yes cout << "YES"
#define no cout << "NO"
#define in(v) for (auto & x : v) cin >> x
#define out(v) for (auto & x : v) cout << x << ' '
#define inLL(v) for (ll & x : v) cin >> x
#define openIn(x) freopen(x, "r", stdin);
#define openOut(x) freopen(x, "w", stdout);
#define M 9302023
#define N 1000005

using namespace std;

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

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 (string d : digits) {
        if (i + d.size() - 1 < n && s.substr(i, d.size()) == d) {
            pair<int, int> cur = slv(i + d.size());
            cur.first += d.size() - 1;
            if (cur.first > ret.first)
                ret = cur;
            else if (cur.first == ret.first)
                ret.second = (ret.second%M + cur.second%M) % M;
        }
    }

    pair<int, int> cur = slv(i + 1);
    if (cur.first > ret.first)
        ret = cur;
    else if (cur.first == ret.first)
        ret.second = (ret.second%M + cur.second%M) % M;

    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 (auto & i : dp) {
        i = { -1, -1 };
    }

    pair<int, int> ans = slv(0);
    cout << n - ans.first << endl << ans.second;
}

int main() {
    MayaZayn

//    int t;
//    cin >> t;
//    while (t--)
        solve();

    return 0;
}