Today Tavas got his test result as an integer score and he wants to share it with his girlfriend, Nafas.

His phone operating system is Tavdroid, and its keyboard doesn't have any digits! He wants to share his score with Nafas via text, so he has no choice but to send this number using words.

<image>

He ate coffee mix without water again, so right now he's really messed up and can't think.

Your task is to help him by telling him what to type.

Input

The first and only line of input contains an integer s (0 ≤ s ≤ 99), Tavas's score. 

Output

In the first and only line of output, print a single string consisting only from English lowercase letters and hyphens ('-'). Do not use spaces.

Examples

Input

6


Output

six


Input

99


Output

ninety-nine


Input

20


Output

twenty

Note

You can find all you need to know about English numerals in <http://en.wikipedia.org/wiki/English_numerals> .
#include <bits/stdc++.h>
using namespace std;
template <typename T>
T BigMod(T b, T p, T m) {
  if (p == 0) return 1;
  if (p % 2 == 0) {
    T s = BigMod(b, p / 2, m);
    return ((s % m) * (s % m)) % m;
  }
  return ((b % m) * (BigMod(b, p - 1, m) % m)) % m;
}
template <typename T>
T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return POW(B, P / 2) * POW(B, P / 2);
}
template <typename T>
T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <typename T>
T lcm(T a, T b) {
  if (a < 0) return lcm(-a, b);
  if (b < 0) return lcm(a, -b);
  return a * (b / gcd(a, b));
}
int b2d(long long n) {
  int decimalNumber = 0, i = 0, remainder;
  while (n != 0) {
    remainder = n % 10;
    n /= 10;
    decimalNumber += remainder * pow(2, i);
    ++i;
  }
  return decimalNumber;
}
vector<long long> decToBinary(int n) {
  vector<long long> binaryNum(12);
  while (n > 0) {
    binaryNum.push_back(n % 2);
    n = n / 2;
  }
  reverse(binaryNum.begin(), binaryNum.end());
  return binaryNum;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
long long toLlint(string s) {
  long long sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
template <class T>
string NTS(T Number) {
  stringstream ss;
  ss << Number;
  return ss.str();
}
bool isprime(int w) {
  if (w == 0) return false;
  if (w == 1) return false;
  int sqrtw = int(sqrt((double)w));
  for (int q = 2; q <= sqrtw; q++) {
    if (w % q == 0) return false;
  }
  return true;
}
const long long N = 1e6 + 1;
bitset<N + 1> bs;
vector<long long> prime;
void sieve() {
  bs.set();
  bs[0] = bs[1] = 0;
  for (long long i = 2; i < N; ++i) {
    if (bs[i]) {
      prime.push_back(i);
      for (long long j = i * i; j < N; j += i) bs[j] = 0;
    }
  }
  return;
}
void prime_divisor(long long n, long long q) {
  if (n % q)
    cout << n << "\n";
  else {
    long long nn = n;
    for (long long i = 1; i <= sqrt(n); i++) {
      if (n % i == 0) {
        {
          if ((n / i) % q != 0) {
            cout << n / i << "\n";
            break;
          }
        }
      }
    }
  }
}
unsigned long long fact(unsigned long long n) {
  if (n <= 1) return 1;
  return fact(n - 1) * n;
}
long long sumDigits(long long n) {
  long long sum = 0;
  while (n != 0) {
    sum += n % 10;
    n /= 10;
  }
  return sum;
}
int main() {
  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
  }
  vector<string> ans{"zero",    "one",     "two",       "three",    "four",
                     "five",    "six",     "seven",     "eight",    "nine",
                     "ten",     "eleven",  "twelve",    "thirteen", "fourteen",
                     "fifteen", "sixteen", "seventeen", "eighteen", "nineteen",
                     "twenty"};
  vector<string> tenth{"twenty", "thirty",  "forty",  "fifty",
                       "sixty",  "seventy", "eighty", "ninety"};
  int n;
  cin >> n;
  if (n <= 20)
    cout << ans[n] << "\n";
  else {
    int rm = n % 10;
    if (rm == 0)
      cout << tenth[(n / 10 - 2)] << "\n";
    else
      cout << tenth[(n / 10 - 2)] << "-" << ans[rm] << "\n";
  }
}
