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.util.*;
import java.io.*;
public class Programa {
    public static class Node {
        ArrayList<Node> near = new ArrayList<Node>();
        
    }
    public static String getAnswer(int h, int[] a, int[] b) {
        int maxLabel = (int) Math.pow(2, h) - 1;
        Node[] nodes = new Node[maxLabel + 1];
        for (int i = 1; i < nodes.length; i++) {
            nodes[i] = new Node();
        }
 
        for (int i = 0; i < a.length; i++) {
            nodes[a[i]].near.add(nodes[b[i]]);
            nodes[b[i]].near.add(nodes[a[i]]);
        }
        for (int i = 1; i < nodes.length; i++) { // ROOT
            for (int j = 0; j < a.length; j++) { // REMOVE THIS EDGE
                nodes[a[j]].near.remove(nodes[b[j]]);
                nodes[b[j]].near.remove(nodes[a[j]]);
                if (possible(nodes[i], null, h)) {
                    return "Correct";
                }
                nodes[a[j]].near.add(nodes[b[j]]);
                nodes[b[j]].near.add(nodes[a[j]]);
 
            }
        }
        return "Incorrect";
    }
    public static boolean possible(Node root, Node parent, int h) {
        ArrayList<Node> nodes = new ArrayList<Node>();
        for (Node node : root.near) {
            if (node != parent && !nodes.contains(node)) {
                nodes.add(node);
            }
        }
        if (h < 1) return false;
        if (nodes.size() == 0) {
            if (h == 1) {
                return true;
            }
        }
        if (nodes.size() != 2) {
            return false;
        }
        boolean good = true;
        for (Node node : nodes) {
            if (!possible(node, root, h - 1)) {
                good = false;
            }
        }
        return good;
    }
    /*
    public static void main(String args[]) {
        System.out.println(getAnswer(3, new int[] {1, 2, 3, 7, 1, 5, 4}, new int[] {6, 7, 4, 3, 3, 1, 7}));
        System.out.println(getAnswer(2, new int[] {1, 2, 3}, new int[] {2, 1, 3}));
    }
    */
    
   
    public static void main(String [] args){
    	Scanner scan = new Scanner (System.in);
    	int n = scan.nextInt();
    	String [] a = {"zero","one", "two", "three" ,"four", "five", "six", "seven", "eight", "nine","ten","eleven", "twelve", "thirteen" ,"fourteen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"};
    	String [] b = {"twenty","thirty", "forty", "fifty" ,"sixty", "seventy", "eighty", "ninety"};
    	
    	if(n < 20)
    		System.out.println(a[n]);
    	else{
    		int u = n % 10;
    		int d = n / 10;
    		if(u != 0)
    		System.out.println(b[d - 2]+"-"+a[u]);
    		else 
    			System.out.println(b[d - 2]);
    	}
    	
    	/*
    	 one	11	eleven	 	 
2	two	12	twelve (a dozen)	20	twenty (a score)
3	three	13	thirteen	30	thirty
4	four	14	fourteen	40	forty (no "u")
5	five	15	fifteen (note "f", not "v")	50	fifty (note "f", not "v")
6	six	16	sixteen	60	sixty
7	seven	17	seventeen	70	seventy
8	eight	18	eighteen (only one "t")	80	eighty (only one "t")
9	nine	19	nineteen	90	ninety (note the "e")
    	 */
    }
}
