////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }

//// i/o helper ////

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl

template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };
template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, pair<T1, T2> &p) { out << p.first << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << ' ';
	auto s = ss.str();
	out << s.substr(0, s.length() - 1) << endl;
	return out;
}

//// start up ////
void solve();
int main()
{
	solve();
	return 0;
}

////////////////////
/// template end ///
////////////////////

void solve()
{
	int cases = INF;
	REP(_, cases)
	{
		READ(string, X);
		if (X == "#") { break; }


		X += "$#?";
		vector<bool> boin(256);
		vector<bool> musei_shiin(256);
		musei_shiin['k'] = musei_shiin['s'] = musei_shiin['t'] = musei_shiin['h'] = musei_shiin['p'] = musei_shiin['$'] = true;

		string result;
		result += X[0];
		char hit = '#';

		for (int i = 1; i < X.size() - 3; i++)
		{
			if (hit == '#')
			{
				switch (X[i])
				{
				case 'i':
				case 'u':
					if (
						(musei_shiin[X[i - 1]] || i > 1 && X[i - 1] == 'y' && musei_shiin[X[i - 2]]) // 前が無声子音
						&& (musei_shiin[X[i+1]] || X[i + 1] == 'y' && musei_shiin[X[i + 2]]) // 後ろが無声子音
						)
						hit = X[i];
					break;
				case 'a':
				case 'o':
					if (
						(musei_shiin[X[i - 1]] || i > 1 && X[i - 1] == 'y' && musei_shiin[X[i - 2]]) // 前が無声子音
						&& (musei_shiin[X[i + 1]] || X[i + 1] == 'y' && musei_shiin[X[i + 2]]) // 後ろが無声子音
						&& (X[i + 2] == X[i] || X[i + 2] == 'y' && X[i + 3] == X[i]) // 後ろが同じ母音無声子音
						)
						hit = X[i];
					break;
				}

				if (hit != '#') result += '(';
				result += X[i];
				if (hit != '#') result += ')';
			}
			else
			{
				if (X[i] == 'a' || X[i] == 'i' || X[i] == 'u' || X[i] == 'e' || X[i] == 'o')
				{
					hit = '#';
				}
				result += X[i];
			}
		}

		WRITE(result);
	}
}

Measured memory_bytes: 1192