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



Sample input:
a


Sample output:
vowel

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("## ",*x,file=sys.stderr)
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reversed=True)  #二個目の要素で降順並び替え

    #N = int(input())
    #N, K = map(int, input().split())
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列

    s=input()
    if s in ("a","i","u","o","e"):
        print("vowel")
    else:
        print("consonant")




if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c = input()
print("vowel" if c in ["a","i","u",'e','o'] else "consonant")

Submission status: Accepted

Solution code:
data = ["a", "e", "i", "o", "u"]
c = input()

if c in data:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
def main():
    c = input()
    if c in ["a", "i", "u", "e", "o"]:
        ans = 'vowel'
    else:
        ans = 'consonant'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s=input()
if s in "aiueo":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
a = str(input())
if a=='a' or a=='i' or a=='u' or a=='e' or a=='o':
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in 'aiueo':
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in 'aiueo':
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowel = ["a", "i", "u", "e","o"]

if c in vowel:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
print("vowel") if input() in "aeiou" else print("consonant")

Submission status: Accepted

Solution code:
# li = sorted(list(map(int, input().split())))
# n, m = map(int, input().split())
c = input()
print("vowel") if c in "aeiou" else print("consonant")

Submission status: Accepted

Solution code:
vo = ["a","e","i","o","u"]
print("vowel" if input() in vo else "consonant")

Submission status: Accepted

Solution code:
#入力
character = input()

#母音リスト
vowels = ['a', 'e', 'i', 'o', 'u']

#出力
if character in vowels:
   print('vowel')
else:
   print('consonant')

Submission status: Accepted

Solution code:
boin = ['a','e','i','o','u']
if input() in boin:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
if (c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u'):
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
print(['consonant','vowel'][input() in 'aeiou'])

Submission status: Accepted

Solution code:
c=input()
res=False
if c=="a":
  res=True
if c=="e":
  res=True
if c=="i":
  res=True
if c=="o":
  res=True
if c=="u":
  res=True
if res:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
print(('consonant','vowel')[input()in'aiueo'])

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    c = input()

    print('vowel') if c in list('aeiou') else print('consonant')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = input()
list = ["a","e","i","o","u"]

if c in list: #cがlistに含まれているか
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
C = input()

if C in ["a","i","u","e","o"]:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
A = ['a', 'e', 'i', 'o', 'u']
if c in A:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()

if c in ['a','e','i','o','u']:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = input()

if c == 'a':
  print('vowel')
elif c == 'i':
  print('vowel')
elif c == 'u':
  print('vowel')
elif c == 'e':
  print('vowel')
elif c == 'o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = input()

if (c in "aiueo"):
    print("vowel")

else:
    print("consonant")

Submission status: Accepted

Solution code:
def actual(c):
    if c in list('aeiou'):
        return 'vowel'

    return 'consonant'

c = input()
print(actual(c))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

v_l = ['a', 'e', 'i', 'o', 'u']

if str(input()) in v_l:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:


def read_int():
    return int(input().strip())


def read_ints():
    return list(map(int, input().strip().split(' ')))


def solve():
    return 'vowel' if input().strip() in 'aeiou' else 'consonant'
    pass


if __name__ == '__main__':
    print(solve())

Submission status: Accepted

Solution code:
def main():
    c = str(input())
    if c == 'a' or c == 'e' or c == 'i' or c == 'o' or c == 'u':
        print('vowel')
    else:
        print('consonant')
main()

Submission status: Accepted

Solution code:
print(['consonant','vowel'][input() in list('aiueo')])

Submission status: Accepted

Solution code:

#lst = list(map(str,input().split()))
st = str(input())
if st in ['a','e','i','o','u']:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
print("vowel" if input() in ["a","e","i","o","u"] else "consonant")

Submission status: Accepted

Solution code:
s = input()
a = ['a', 'i', 'u', 'e', 'o']
for i in a:
  if s == i:
    print('vowel')
    exit()
    
print('consonant')

Submission status: Accepted

Solution code:
if input() in "aeiou":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
aiueo = ['a', 'i', 'u', 'e', 'o']

if input() in aiueo:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
s = input()
l = ["a", "i", "u", "e", "o"]
print("vowel" if s in l else "consonant")

Submission status: Accepted

Solution code:
t = input()

if "a" == t:
    print("vowel")
elif "i" == t:
    print("vowel")
elif "u" == t:
    print("vowel")
elif "e" == t:
    print("vowel")
elif "o" == t:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
"""
int #整数
float #小数

#標準入力
a=input()
a,b=map(int,input().split()) #入力は行ごと
#標準出力
print(a)
ptrint("Hello")
#for
for name in fruits: #fruitの頭から操作
    print(name)
#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト内の2の数
abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値

extension_1 = []
for i in range(10):
    extension_1.append(i)
extension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]

comprehension_1= [i for i in range(10)]
comprehension_1
#>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
"""
a = input()
if a=="a" or a=="e" or a=="i" or a=="o" or a=="u":
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
n = input()
v = ["a","i","u","e","o"]
if(n in v):
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
A=input()
X=["a","i","u","e","o"]
if A in X:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()

d = ['a','i','u','e','o']

if c in d:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()
list_a = ["a", "i", "u", "e", "o"]

if c in list_a:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    c = input()
    L = list("aiueo")
    print("vowel" if c in L else "consonant")


if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
c=input()
if c in ['a','e','i','o','u']:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

def main():
    c = input()
    str = ['a', 'i', 'u', 'e', 'o']
    if c in str:
        print('vowel')
    else:
        print('consonant')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c = input()
a =['a','i','u','e','o']
if c in a:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c=input()
if c in "aiueo":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
v = ['a', 'e', 'i', 'o', 'u']
print('vowel' if c in v else 'consonant')

Submission status: Accepted

Solution code:
c = input()
if c == 'a'or c =='i'or c =='u' or c == 'e'or c == 'o':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
vowel=["a","i", "u", "e", "o"]

c=input()

if c in vowel:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
s = input()
if s == 'a' or s == 'i' or s == 'u' or s == 'e' or s == 'o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = str(input())
print("vowel" if c in "aiueo" else "consonant")

Submission status: Accepted

Solution code:
c=str(input())
l=["a","i","u","e","o"]
print("vowel" if c in l else "consonant")

Submission status: Accepted

Solution code:
consonant = ['a', 'i', 'u', 'e', 'o']
c = input()
if c in consonant:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = input()
if c in ['a','i','u','e','o']:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
print('cvoonwseoln a n t'[input() in ['a','e','i','u','o']::2])

Submission status: Accepted

Solution code:
c = input()
if c in 'aiueo':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
[print("vowel") if input() in "aiueo" else print("consonant")]

Submission status: Accepted

Solution code:
c = input()

if c == 'a' or c == 'i' or  c == 'u' or c == 'e' or c == 'o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = str(input())
s = "aiueo"
if c in s: print("vowel")
else: print("consonant")

Submission status: Accepted

Solution code:
c = input()
s = 'aiueo'
if c in s: print('vowel')
else: print('consonant')

Submission status: Accepted

Solution code:
c=input()
v=['a','i','u','e','o']
if c in v:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = str(input())
if c == "a" or c == "e" or c == "i" or c == "o" or c == "u":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
if c in ["a", "i", "u", "e", "o"]:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
if c in ["a", "e", "i","o","u"]:
  print("vowel")
else :
  print("consonant")

Submission status: Accepted

Solution code:
print('vowel' if input() in ('a', 'e', 'i', 'o', 'u') else 'consonant')

Submission status: Accepted

Solution code:
c = input()
vowel = ['a','e','i','o','u']
if c in vowel:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c=input()
 
if c=='a' or c=='i' or c=='u' or c=='e' or c=='o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
# Vicfred
# https://atcoder.jp/contests/abc049/tasks/abc049_a
# simulation
c = input()

vowels = ['a', 'i', 'u', 'e', 'o']

if c in vowels:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in "aiueo":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c=input()
if c=='a' or c=='e' or c=='i' or c=='o' or c=='u':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()
listc = ['a', 'e', 'i', 'o', 'u']
count = 0

for i in range(len(listc)):
    if c == listc[i]:
        count += 1
        break

if count > 0:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()
vowel = ["a", "e", "i", "o", "u"]
if c in vowel:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowel = ['a', 'e', 'i', 'o', 'u']
if c in vowel:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()
if c in['a','i','u','e','o']:
	print('vowel')
else:
  	print('consonant')

Submission status: Accepted

Solution code:
c = input()
vowellist = ["a","i","u","e","o"]
judge = "a"
for w in vowellist:
    if c == w:
        judge = "vowel"
        break
    else:
        judge = "consonant"
print(judge)

Submission status: Accepted

Solution code:
s = str(input())
if s=='a' or s=='i' or s=='o' or s=='e' or s=='u':
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
a = input()
if a in ["a","e","i","o","u"]:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
print("vowel" if input() in "aeiouAEIOU" else "consonant")

Submission status: Accepted

Solution code:
c = input()

if c=="a" or c=="e" or c=="i" or c=="o" or c=="u":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
if c in ['a', 'i', 'u', 'e', 'o']:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
s = input()
if s in "aeiou":
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowel = ['a', 'e', 'i', 'o', 'u']
print('vowel' if c in vowel else 'consonant')

Submission status: Accepted

Solution code:
import re
l = input()
p = re.compile('[a-z]')

vowel = ['a', 'i', 'u', 'e', 'o']
if p.fullmatch(l):
  if l in vowel:
    print('vowel')
  else:
    print('consonant')

Submission status: Accepted

Solution code:
s = input()


boin = ['a', 'i', 'u', 'e', 'o']

if s in boin:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()

# 母音リスト
boon = ['a', 'i', 'u', 'e', 'o']

# cが母音リストに含まれるかを判定する
if c in boon:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
komoji = input()
if komoji in"aeiou":
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
inp = input()
listp = ["a","i","u","e","o"]
if inp in listp:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowel = ['a', 'e', 'i', 'o', 'u']

print('vowel') if c in vowel else print('consonant')

Submission status: Accepted

Solution code:
import sys
c=input()
List=["a","i","u","e","o"]
for i in List:
    if i==c:
        print("vowel")
        sys.exit()
print("consonant")

Submission status: Accepted

Solution code:
c = input()[0]
boin = ['a', 'e', 'i', 'o', 'u']

if c in boin:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
a=input()
if (a == 'a' or a == 'i' or a == 'u' or a == 'e' or a == 'o'):
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
c = input()
if c=='a' or c=='i' or c=='u' or c=='e' or c=='o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = input()

if c == "a" or c == "i" or c == "u" or c=="e" or c =="o":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowels = 'aeiou'
if c in vowels:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
n=input()
if n=='a' or n=='i' or n=='u' or n=='e' or n=='o':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
print('vowel' if input() in 'aeiou' else 'consonant')

Submission status: Accepted

Solution code:
c=str(input())

if c in 'aiueo':
    print('vowel')

else:
    print('consonant')

Submission status: Accepted

Solution code:
c =input()
if (c=="a" or c=="i" or c=="u" or c=="e" or c=="o"):
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:

c=str(input())

if c=='a' or c=='e' or c=='i' or c=='o' or c=='u':
    print('vowel')

else:
    print('consonant')

Submission status: Accepted

Solution code:
boin=["a","i","u","e","o"]
if input() in boin:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
l = ['a', 'e', 'i', 'o', 'u']
c = input()
if (c in l) == True:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
l = ['a', 'e', 'i', 'o', 'u']
c = input()
if (c in l) == True:
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
vowel = ["a", "i", "u", "e", "o"]
p = input()
if p in vowel:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
x = input()

if x == 'a' or x == 'i' or x == 'u' or x == 'e' or x == 'o':
    print("vowel")

else:
    print("consonant")

Submission status: Accepted

Solution code:
c=input()
if c==('a'):
    print ('vowel')
elif c==('i'):
    print('vowel')
elif c==('u'):
    print('vowel')
elif c==('e'):
    print('vowel')
elif c==('o'):
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c=input()
if c=='a'or c=='i'or c=='u'or c=='e'or c=='o':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
v = ["a","i","u","e","o"]

print("vowel" if input() in v else "consonant")

Submission status: Accepted

Solution code:
s = input()
if s in {'a','e','i','o','u'}:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
print("vowel" if input() in ['a','e','i','o','u'] else "consonant")

Submission status: Accepted

Solution code:
c = input()
if c in ['a','e','i','o','u']:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
v = ["a", "e", "i", "o", "u"]
if input() in v:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    s = input()
    print('vowel') if s in ['a','i','u','e','o'] else print('consonant')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
c = input()
if c == 'a' or c =='i' or c == 'u' or c == 'e' or c =='o':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
from sys import stdin
def S(): return stdin.readline().rstrip()

s = ['a', 'i', 'u', 'e', 'o']

c = S()

if 0<s.count(c):
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
s = input()
if s == "a" or s == "i" or s == "u" or s == "e" or s == "o" :
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in "aiueo":
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in ["a", "i", "u", "e", "o"]:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
A = ['a','i','u','e','o']
c = input()
if c in A:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

c = input()
if c in 'aiueo':
	print('vowel')
else:
	print('consonant')

Submission status: Accepted

Solution code:
c=input()
boin={"a","i","u","e","o"}

if c in boin:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c=input()
if (c in ["a","e","i","o","u"]):
    print ("vowel")
else:
    print ("consonant")

Submission status: Accepted

Solution code:
a = input()
t = "aeiou"

if a in t:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
N = ['a','e','i','o','u']
if input() in N:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input()
if  c in 'aeiou':
  print('vowel')
else:
  print('consonant')

Submission status: Accepted

Solution code:
c = input()

l = ["a", "i", "u", "e", "o"]

if c in l:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
print("vowel") if c in "aeiou" else print("consonant")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import re
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    if re.match(r'[aeiou]',input()):
        print('vowel')
    else:
        print('consonant')
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = 'aeiou'
c = input()
print('vowel' if c in s else 'consonant')

Submission status: Accepted

Solution code:
c=input()
listVowels=["a","e","i","o","u"]
isVowel=c in listVowels
if isVowel:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
s=input()
a=['a','e','i','u','o']
print('vowel' if s in a else 'consonant')

Submission status: Accepted

Solution code:
c =input()
if c in ["a","i","u","e","o"]:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
def main():
 name =input()
 if name=='a' or name =='i' or name =='u' or name =='e' or name=='o' :
  print('vowel')
 else :
  print('consonant')
 
main()

Submission status: Accepted

Solution code:
c=input()
if c=='a' or  c=='i' or  c=='u' or  c=='e' or  c=='o' :
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
if c in "aiueo":
	print("vowel")
else:
	print("consonant")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 17:37:51 2020

@author: shinba
"""

vowel = ["a","i","u","e","o"]

if input() in vowel:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
s = input()

vowel_list = ['a', 'i', 'u', 'e', 'o']

if s in vowel_list:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
if input() in ["a","e","i","o","u"]:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
S = input()
ls = ["a","i","u","e","o"]
if S in ls:
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()

if c in 'aiueo':
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
s = input()

if s=="a" or s=="o" or s=="u" or s=="e" or s=="i":
  print("vowel")
  
else:
  print("consonant")

Submission status: Accepted

Solution code:
vowels = ['a', 'e', 'i', 'o', 'u']
c = input()
if c in vowels:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c=str(input())
if c in "aiueo":
  print("vowel")
else:
  print("consonant")

Submission status: Accepted

Solution code:
c = input()
vowel = ['a', 'i', 'u', 'e', 'o']
if c in vowel:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
vowel = set(['a', 'i', 'u', 'e', 'o'])
c = input()
if c in vowel:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
import sys
import math
import bisect

def main():
    if input() in 'aeiou':
        print('vowel')
    else:
        print('consonant')
 
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
print("vowel"if input() in"aiueo" else "consonant")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
print(['vowel', 'consonant'][input() not in ['a', 'i', 'u', 'e', 'o']])

Submission status: Accepted

Solution code:
c = input()
if c in ['a','e','i','o','u']:
    print('vowel')
else:
    print('consonant')

Submission status: Accepted

Solution code:
c = input();
l = ['a', "i", "u", "e", "o"]

if c in l:
    print("vowel")
else:
    print("consonant")

Submission status: Accepted

Solution code:
c = input()
print('vowel' if c in ['a', 'e', 'i', 'o', 'u'] else 'consonant')

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

boin = ["a", "e", "i", "o", "u"]
c = input()

if c in boin:
	print("vowel")
else:
	print("consonant")