#include <bits/stdc++.h>
  
using namespace std;

#define pb push_back
#define sz(x) int(x.size())
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define cin(v) for (auto& cn : v)  cin >> cn;
#define cout(v) for (auto &cn : v) cout << cn << " ";
#define MOD int(1e9+7)
// #define endl "\n"
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

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
}
 
void solve();
int main()
{
    Haidy();
    int t = 1;
    // cin >> t;
    for(int i = 1;i<=t; i++)
    {
        solve();
    }
    return 0;
}
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};

string s;
int n;
vector<int> dp;
set<string> num = {"zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine"};

int rec(int i){
    if(i == n) return 0;
    if(~dp[i]) return dp[i];
    int ans = 1e9;
    for(int j = 1; j <= 5; j++){
        if(i + j <= n){
            string sub = s.substr(i, j);
            if(num.count(sub)){
                ans = min(ans, rec(i + j) + 1);
            }
        }
    }
    ans = min(ans, rec(i + 1) + 1);
    return dp[i] = ans;
}

ll cnt = 1;
ll mod = 9302023;
void paths(int i){
    if(i == n) return;
    ll cur = 0;
    for(int j = 1; j <= 5; j++){
        if(i + j <= n){
            string sub = s.substr(i, j);
            if(num.count(sub)){
                if(dp[i] == dp[i + j] + 1){
                    cur++;
                    paths(i + j);
                }
            }
        }
    }
    if(dp[i] == dp[i + 1] + 1){
        cur++;
        paths(i + 1);
    }
    cur = max(cur, 1LL);
    cnt = (cnt * cur) % mod;
}
 
void solve()
{
    cin >> s;
    n = sz(s);
    dp.assign(n+2, -1);
    cout << rec(0) << endl;
    paths(0);
    cout << cnt;
}