#include <bits/stdc++.h>

//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (a); i > (n); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) for (auto i = (x).rbegin(); i != (x).rend(); ++i)
//降順はgreater<T>()
#define all(x) (x).begin(), (x).end()
#define rv(s) reverse((s).begin(), (s).end())
// gcd lcmはそのままok
#define gcd(a, b) __gcd(a, b)
#define bits(n) (1LL << (n))
#define pcnt(x) __builtin_popcountll(x)
//配列内等要素削除
#define unique(x) (x).erase(unique((x).begin(), (x).end()), (x).end())
#define Fixed(n) fixed << setprecision(n)
//総和
#define sowa(n) ((n) * ((n) + 1)) / 2
#define pb(x, a) (x).push_back(a)
#define fb(x, a) (x).push_front(a)
#define eb(x, a) (x).emplace_back(a)
#define cauto const auto &
using P = pair<int, int>;
using Graph = vector<vector<P>>;
template <class T>  //昇順
using min_heap = priority_queue<T, vector<T>, greater<T>>;
template <class T>  //降順
using max_heap = priority_queue<T>;
template <class A, class B>
using umap = unordered_map<A, B>;
template <class A>
using uset = unordered_set<A>;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {  //多次元初期化
  std::fill((T *)array, (T *)(array + N), val);
}
template <class A, class B>
bool chmax(A &a, const B &b) {  //最大値更新 返り値はbool
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class A, class B>
bool chmin(A &a, const B &b) {  //最小値更新 返り値はbool
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
constexpr int INF = 0x3f3f3f3f;
constexpr int LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr int mod1 = 1e9 + 7;
constexpr int mod2 = 998244353;
//} END

signed main(void) {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);

  string s;
  cin >> s;
  rep(i, 0, s.size()) {
    if (i != 0) cout << ' ';
    switch (s[i]) {
      case 'a':
        cout << "う し";
        break;
      case 'b':
        cout << "う あ";
        break;
      case 'c':
        cout << "ん 笑";
        break;
      case 'd':
        cout << "た ぷ";
        break;
      case 'e':
        cout << "く ん";
        break;
      case 'f':
        cout << "ぷ に";
        break;
      case 'g':
        cout << "し き";
        break;
      case 'h':
        cout << "あ く";
        break;
      case 'i':
        cout << "う く";
        break;
      case 'j':
        cout << "あ 笑";
        break;
      case 'k':
        cout << "う ん";
        break;
      case 'l':
        cout << "し ぷ";
        break;
      case 'm':
        cout << "う き";
        break;
      case 'n':
        cout << "く 笑";
        break;
      case 'o':
        cout << "う 笑";
        break;
      case 'p':
        cout << "に き";
        break;
      case 'q':
        cout << "ぷ 笑";
        break;
      case 'r':
        cout << "た き";
        break;
      case 's':
        cout << "た ん";
        break;
      case 't':
        cout << "し あ";
        break;
      case 'u':
        cout << "し ん";
        break;
      case 'v':
        cout << "う う";
        break;
      case 'w':
        cout << "う た";
        break;
      case 'x':
        cout << "き 笑";
        break;
      case 'y':
        cout << "に く";
        break;
      case 'z':
        cout << "笑 笑";
        break;
    }
  }
  cout << '\n';
  return 0;
}