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

#include  <ext/pb_ds/assoc_container.hpp>
#include  <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#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 unsigned 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 ll INF = (ll)1e18 + 4747;

int solve()
{
	string s;
	if (!(cin >> s))
		return 1;
	
	int n = sz(s);
	reverse(all(s));
	
	if (s[0] != 'O')
	{
		cout << "INVALID\n";
		return 0;
	}
	
	FOR (i, 0, n)
	{
		if (s[i] != 'O' && s[i] != 'E')
		{
			cout << "INVALID\n";
			return 0;
		}
	}
	FOR (i, 1, n)
	{
		if (s[i] == 'O' && s[i - 1] == 'O')
		{
			cout << "INVALID\n";
			return 0;
		}
	}
	
	vector<ll> twos{1};
	int m = 64;
	while (sz(twos) < m)
		twos.pb(twos.back() * 2);
	
	//cerr << twos.back() << '\n';
	
	vector<ll> resp(m, -1);
	ll ans = INF;
	FOR (i, 2, m)
	{
		ll tw = twos[i];
		if (tw % 3 == 1)
		{
			__int128 cur = tw / 3;
			//srting str = "";
			bool ok = 1;
			FOR (j, 1, n)
			{
				if (s[j] == 'O')
				{
					if (cur % 2 == 0 && cur % 3 == 1)
						cur /= 3;
					else
					{
						ok = 0;
						break;
					}
				}
				else
				{
					cur *= 2;
				}
			}
			auto it = lower_bound(all(twos), cur);
			if (ok && (it == twos.end() || *it != cur))
				ans = min(ans, (ll)cur);
		}
	}
	if (ans == INF)
		cout << "INVALID\n";
	else
		cout << ans << '\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;
}