Problem:
Score : 100 points

Problem Statement

Given a lowercase English letter c, determine whether it is a vowel. Here, there are five vowels in the English alphabet: a, e, i, o and u.

Constraints

c is a lowercase English letter.

Input

The input is given from Standard Input in the following format:

c

Output

If c is a vowel, print vowel. Otherwise, print consonant.

Sample Input 1

a

Sample Output 1

vowel

Since a is a vowel, print vowel.

Sample Input 2

z

Sample Output 2

consonant

Sample Input 3

s

Sample Output 3

consonant

Solution in C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
namespace Code1
{	
	class MainClass
	{
		class Vector2 {
			public Vector2(int x, int y){
				this.x = x;
				this.y = y;
			}
			public int x;
			public int y;
		}

		public static void Main (string[] args)
		{
			string input = Console.ReadLine ();
			switch (input) {
			case "a":
			case "i":
			case "u":
			case "e":
			case "o":	
				Console.WriteLine ("vowel");
				break;
			default:
				Console.WriteLine ("consonant");
				break;
			}
			/*
			string heightAndWidthString = Console.ReadLine ();
			var heightAndWidth = heightAndWidthString.Split (' ');
			var height = int.Parse (heightAndWidth [0]);
			var width = int.Parse (heightAndWidth [1]);

			string[] pathRaws = new string[height];
			while (true) {
				var pathRow = Console.ReadLine ();
				if (pathRow == "") {
					break;
				}
			}
			char[, ] pathCells = new char[width, height];
			var i = 0;
			var j = 0;
			foreach (string pathRaw in pathRaws) {
				j++;
				foreach (char cell in pathRaw) {
					pathCells [i, j] = cell;
					i++;
				}
			}
			if (Possible (width, height, pathCells)) {
				Console.WriteLine ("Possible");
			} else {
				Console.WriteLine ("Impossible");
			}
*/

		}

		/*
		public static bool Possible(int width, int height, char[, ] pathCells) {
			var currentCell = new Vector2 (0, 0);
			while (currentCell.x != width - 1 || currentCell.y != height - 1) {
				var ableToMoveCount = 0;
				// 右に進める
				if (currentCell.x != width - 1 && pathCells [currentCell.x + 1, currentCell.y] == '#') {
					ableToMoveCount++;
					currentCell.x++;
				}
				// 下に進める
				if (currentCell.y != height - 1 && pathCells [currentCell.x, currentCell.y + 1] == '#') {
					ableToMoveCount++;
					currentCell.y++;
				}
				if (ableToMoveCount != 1) {
					return false;
				}
			}
			return true;

		}
		*/
	}
}