#include <bits/stdc++.h>
using namespace std;
inline int Set(int N, int pos) { return N = N | (1 << pos); }
inline int Reset(int N, int pos) { return N = N & ~(1 << pos); }
inline bool check(int N, int pos) { return (bool)(N & (1 << pos)); }
template <class T>
T gcd(T a, T b) {
  return (a % b == 0) ? b : gcd(b, a % b);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd(a, b)) * b;
}
template <class T>
bool is_prime(T n) {
  if ((n % 2 == 0 && n > 2) || n < 2) return 0;
  for (T i = 3; i * i <= n; i = i + 2) {
    if (n % i == 0) return 0;
  }
  return 1;
}
map<int, string> f;
int main() {
  f[0] = "zero";
  f[1] = "one";
  f[2] = "two";
  f[3] = "three";
  f[4] = "four";
  f[5] = "five";
  f[6] = "six";
  f[7] = "seven";
  f[8] = "eight";
  f[9] = "nine";
  f[10] = "ten";
  f[11] = "eleven";
  f[12] = "twelve";
  f[13] = "thirteen";
  f[15] = "fifteen";
  f[18] = "eighteen";
  f[20] = "twenty";
  f[30] = "thirty";
  f[40] = "forty";
  f[50] = "fifty";
  f[60] = "sixty";
  f[70] = "seventy";
  f[80] = "eighty";
  f[90] = "ninety";
  int n;
  while (cin >> n) {
    if (n <= 12 || n == 15 || n == 18 || n == 13)
      cout << f[n] << endl;
    else if (n > 12 && n < 20)
      cout << f[n % 10] + "teen\n";
    else if (n % 10) {
      cout << f[n - (n % 10)] + "-" + f[n % 10] << endl;
    } else
      cout << f[n] << endl;
  }
  return 0;
}
