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> .
import java.io.*; 
import java.util.*; 
public class Main{
    public static void main(String args[]){
	   InputReader in = new InputReader(System.in); 
          int no = in.readInt(); 
          String s [] = {"zero","one","two","three","four","five","six","seven","eight","nine","ten", "eleven","twelve","thirteen","fourteen","fifteen","sixteen","seventeen","eighteen","nineteen","twenty","thirty","forty","fifty","sixty","seventy","eighty","ninety"};                                                                       
          if(no < 20){
               System.out.println(s[no]);
          }
          else{
               int index = 20;
               if(no%10 == 0){
                    index += no/10-2;
                    System.out.println(s[index]);
               }
               else{
                    int firstDigit = no/10*10;
                    int secondDigit = no%10;
                    index += firstDigit/10-2; 
                    firstDigit = index ; 
                    System.out.println(s[firstDigit] + "-" + s[secondDigit]);
               }
                
          }
          
   } 
}
class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public String next() {
		return readString();
	}
	
	public long readLong() {
			int c = read();
			while (isSpaceChar(c)) {
				c = read();
			}
			int sgn = 1;
			if (c == '-') {
				sgn = -1;
				c = read();
			}
			long res = 0;
			do {
				if (c < '0' || c > '9') {
					throw new InputMismatchException();
				}
				res *= 10;
				res += c - '0';
				c = read();
			} while (!isSpaceChar(c));
			return res * sgn;
		}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void printLine(Object... objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}

	public void flush() {
		writer.flush();
	}

}

class Utils {
/////////////////////////////////////////////////////////////////////////////////////////////
	
///////////////////////////////  HEAP SORT ALGORITHM ////////////////////////////////////////////
	
	static void heapSort(int arr[]) { 
		build_maxheap(arr,arr.length);
		
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	}
	

	static void build_maxheap(int Arr[], int N) {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	}

	static void max_heapify(int Arr[], int i, int N) {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
	
////////////////////////////  INDEX BASED ARRAY SWAPPING  //////////////////////////////////
	
    public static void swapArray(int arr[] , int xindex, int yindex) {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    }
    
////////////////////////////////////////////////////////////////////////////////////////////
    
/////////////////////////  READING INTEGER ARRAY  //////////////////////////////////////////
	public static int[] readIntArray(InputReader in, int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
}