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

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;

const int MOD = 9302023;

ll add(ll a, ll b)
{
	return a + b >= MOD ? a + b - MOD : a + b;
}

ll mult(ll a, ll b)
{
	return a * b % MOD;
}

ll binPow(ll a, ll b)
{
	ll res = 1;
	while (b)
	{
		if (b & 1)
			res = mult(res, a);
		a = mult(a, a);
		b >>= 1;
	}
	return res;
}


int solve()
{
	string s;
	if (!(cin >> s))
		return 1;
	
	int n = sz(s);	
	vector<string> a {"zero", "one", "two", "three",
"four", "five", "six", "seven", "eight", "nine"};
	vector<pii> dp(n + 1, {1e9, 1});
	dp[0] = {0, 1};
	FOR (i, 1, n + 1)
	{
		dp[i] = {dp[i - 1].x + 1, dp[i - 1].y};
		for (string num: a)
		{
			if (i >= sz(num) && s.substr(i - sz(num), sz(num)) == num)
			{
				pii pr = dp[i - sz(num)];
				if (dp[i].x > pr.x + 1)
				{
					dp[i] = {pr.x + 1, pr.y};
				}
				else if (dp[i].x == pr.x + 1)
				{
					dp[i].y = add(dp[i].y, pr.y);
				}
			}
		}
	}
	cout << dp[n].x << '\n' << dp[n].y << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}