#include <bits/stdc++.h>

#define ll long long
#define endl '\n'
using namespace std;
void Haidy();

int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};
const int MOD = int(1e9 + 7);

string s;
int n;
vector<int> dp;
set<string> num = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};
ll cnt = 1;
ll mod = 9302023;
ll rec(ll i){
    if(i == n) return 0;
    if(~dp[i]) return dp[i];
    ll a1, a2;
    a1 = a2 = 1e9;
    for(int j = 3; j <= 5; j++){
        if(i + j <= n){
            string sub = s.substr(i, j);
            if(num.count(sub)){
                a1 = rec(i + j) + 1;
            }
        }
    }
    a2 = rec(i + 1) + 1;
    if(a1 == a2 && a1)
        cnt = (cnt * 2) % mod;
    return dp[i] = min(a1, a2);
}

void solveTest() {
    cin >> s;
    n = s.size();
    dp.assign(n+2, -1);
    cout << rec(0) << endl;
    cout << cnt;
}

int main() {
    Haidy();
    int testCases = 1;
//    cin >> testCases;
    while(testCases--)
        solveTest();
    return 0;
}

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