Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n, x, y = map(int, input().split())
ans = [0] * n
a = [n] * n
x -= 1
y -= 1
for i in range(0, n):
    a = [n] * n
    a[i] = 0
    for j in range(i, 0, -1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j - 1] = min(a[j - 1], a[j] + 1)
    for j in range(i, n - 1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j + 1] = min(a[j + 1], a[j] + 1)
    for j in range(x, 0, -1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j - 1] = min(a[j - 1], a[j] + 1)
    for j in range(x, n - 1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j + 1] = min(a[j + 1], a[j] + 1)
    for j in range(y, 0, -1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j - 1] = min(a[j - 1], a[j] + 1)
    for j in range(y, n - 1):
        if j == x:
            a[y] = min(a[y], a[j] + 1)
        if j == y:
            a[x] = min(a[x], a[j] + 1)
        a[j + 1] = min(a[j + 1], a[j] + 1)
    for k in range(0, n):
        if k != i:
            ans[a[k]] += 1
for i in range(1, n):
    print(ans[i] // 2)


Fixed submission:
n, x, y = map(int, input().split())
ans = [0] * n
a = [n] * n
x -= 1
y -= 1
for i in range(0, n):
    a = [n] * n
    a[i] = 0
    b = [i, x, y, x, y]
    for k in b:
        for j in range(k, 0, -1):
            if j == x:
                a[y] = min(a[y], a[j] + 1)
            if j == y:
                a[x] = min(a[x], a[j] + 1)
            a[j - 1] = min(a[j - 1], a[j] + 1)
        for j in range(k, n - 1):
            if j == x:
                a[y] = min(a[y], a[j] + 1)
            if j == y:
                a[x] = min(a[x], a[j] + 1)
            a[j + 1] = min(a[j + 1], a[j] + 1)
    for k in range(0, n):
        ans[a[k]] += 1
for i in range(1, n):
    print(ans[i] // 2)
Buggy python submission (verdict: Runtime Error):
n,m,x = map(int, input().split())
ca = []
for i in range(m):
    ca.append(list(map(int, input().split())))

c = []
a = []
for i in range(len(ca)):
    c.append(ca[i][0])
    a.append(ca[i])
    del a[i][0]

ans = 12345678
for i in range(2 ** n):
    cost = 0
    level = [0] * m
    for j in range(n):
        if(i>>j&1):
            cost += c[j]
            for k in range(m):
                level[k] += a[j][k]
    flag = True
    for k in range(m):
        if(level[k] < x):
            flag = False
    if(flag):
        ans = min(ans,cost)
if(ans == 12345678):
    print(-1)
else:
    print(ans)

Fixed submission:
n,m,x = map(int, input().split())
ca = []
for i in range(n):
    ca.append(list(map(int, input().split())))

c = []
a = []
for i in range(len(ca)):
    c.append(ca[i][0])
    a.append(ca[i])
    del a[i][0]

ans = 12345678
for i in range(2 ** n):
    cost = 0
    level = [0] * m
    for j in range(n):
        if((i>>j)&1):
            cost += c[j]
            for k in range(m):
                level[k] += a[j][k]
    flag = True
    for k in range(m):
        if(level[k] < x):
            flag = False
    if(flag):
        ans = min(ans,cost)
if(ans == 12345678):
    print(-1)
else:
    print(ans)
Buggy python submission (verdict: Runtime Error):
import random

n = int(input())
m = []
for i in range(n):
    m.append(input())  

# l = list(range(n-1))
ll = []
for j in range(n):
    ll.append(m[random.randrange(n-1)])
print(len(set(ll)))

Fixed submission:
import random

n = int(input())
m = []
for i in range(n):
    m.append(input())  

# ll = []
# for j in range(n):
#     ll.append(m[random.randrange(n)])
print(len(set(m)))
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
count = 0
for i in range(0,len(s)):
    for j in range(i+4,len(s)):
        ss = s[i:j+1]
        if int(ss) % 2019  == 0:
            count += 1
print(count)

Fixed submission:
s = input()
n = len(s)
r = list(reversed(s))
x = 1
t = 0
c = [0] * 2019
ans = 0
for i in range(n):
    c[t] += 1
    t += (int(r[i]))*x
    t %= 2019
    ans += c[t]
    x = x*10%2019
   
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
count = 0
for i in range(0,len(s)):
    for j in range(i+4,len(s)):
        ss = s[i:j+1]
        if int(ss) % 2019  == 0:
            count += 1
print(count)

Fixed submission:
s = input()
n = len(s)
r = list(reversed(s))
x = 1
t = 0
c = [0] * 2019
ans = 0
for i in range(n):
    c[t] += 1
    t += (int(r[i]))*x
    t %= 2019
    ans += c[t]
    x = x*10%2019
   
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
s = input()
count = 0
for i in range(0,len(s)):
    for j in range(i+1,len(s)):
        ss = s[i:j+1]
        if int(ss) % 2019  == 0:
            count += 1
print(count)

Fixed submission:
s = input()
n = len(s)
r = list(reversed(s))
x = 1
t = 0
c = [0] * 2019
ans = 0
for i in range(n):
    c[t] += 1
    t += (int(r[i]))*x
    t %= 2019
    ans += c[t]
    x = x*10%2019
   
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

num = [0] * n
for i in a:
    num[i-1] += 1
print(*num)  

Fixed submission:
import math

r = int(input())
print(2*math.pi*r)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

num = [0] * n
for i in range(0,n):
    num[i-1] += 1
print(num)    

Fixed submission:
import math

r = int(input())
print(2*math.pi*r)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

num = [0] * (len(a)+1)
for i in range(0,n):
    for j in range(len(a)):
        if a[j] == i+1:
            num[i] += 1
            if num[i] == a[j]:
                continue
    print(num[i])  

Fixed submission:
import math

r = int(input())
print(2*math.pi*r)

Buggy python submission (verdict: Runtime Error):
i = list(map(int, input().split()))
j = list(map(int, input().split()))

jj = sum(j)

if i[0]-jj < 0:
    print(-1)
else:
    print(i[0]-jj)

Fixed submission:
import math

r = int(input())
print(2*math.pi*r)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
for i in range(1,n+1):
    print(a.count(i))

Fixed submission:
n = int(input())
a = list(map(int, input().split()))

num = [0] * n

for i in a:
    num[i-1] += 1

print(*num)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

num = [0] * (len(a)+1)
for i in range(0,n):
    for j in range(len(a)):
        if a[j] == i+1:
            num[i] += 1
            if num[i] == a[j]:
                continue
    print(num[i])  

Fixed submission:
n = int(input())
a = list(map(int, input().split()))

num = [0] * n

for i in a:
    num[i-1] += 1

print(*num)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

num = [0] * (len(a)+1)
for i in range(0,n):
    for j in range(len(a)):
        if a[j] == i+1:
            num[i] += 1
    print(num[i]) 

Fixed submission:
n = int(input())
a = list(map(int, input().split()))

num = [0] * n

for i in a:
    num[i-1] += 1

print(*num)
Buggy python submission (verdict: Runtime Error):
int = int(input())
st = str(int)
chars = list(st)
if chars[0] == 7:
  print("Yes")
elif chars[1] == 7:
  print("Yes")
elif chars[2] == 7:
  print("Yes")
else print("No")

Fixed submission:
int = int(input())
st = str(int)
chars = list(st)
if chars[0] == "7":
  print("Yes")
elif chars[1] == "7":
  print("Yes")
elif chars[2] == "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
int = input()
st = str(int)
chars = list(st)
if chars[0] == 7:
  print("Yes")
elif chars[1] == 7:
  print("Yes")
elif chars[2] == 7:
  print("Yes")
else print("No")

Fixed submission:
int = int(input())
st = str(int)
chars = list(st)
if chars[0] == "7":
  print("Yes")
elif chars[1] == "7":
  print("Yes")
elif chars[2] == "7":
  print("Yes")
else:
  print("No")

Buggy python submission (verdict: Runtime Error):
str = input()
chars = list(str)
if chars[0] == 7:
  print("Yes")
elif chars[1] == 7:
  print("Yes")
elif chars[2] == 7:
  print("Yes")
else print("No")

Fixed submission:
int = int(input())
st = str(int)
chars = list(st)
if chars[0] == "7":
  print("Yes")
elif chars[1] == "7":
  print("Yes")
elif chars[2] == "7":
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
list = []
i = int(input())
if i%3 != 0 or i%5 != 0:
  list.add(i)
print(sum(list))

Fixed submission:
list = []
i = int(input())
for j in range(1,i+1):
    if j%3 == 0 or j%5 == 0:
        list.append(0)
    else:
        list.append(j)
print(sum(list))
Buggy python submission (verdict: Time Limit Exceeded):
import fractions
from functools import reduce
 
def aaa(*numbers):
    return reduce(fractions.gcd, numbers)
 
num = int(input())
list = []
for i in range(1,num+1):
    for j in range(1,num+1):
        for k in range(1,num+1):
            list.append(aaa(i,j,k))
print(sum(list))

Fixed submission:
import math
from functools import reduce
 
def aaa(*numbers):
    return reduce(math.gcd, numbers)
 
num = int(input())
list = []
for i in range(1,num+1):
    for j in range(1,num+1):
        for k in range(1,num+1):
            list.append(aaa(i,j,k))
print(sum(list))

Buggy python submission (verdict: Runtime Error):
import math
from functools import reduce

def gcd(*numbers):
    return reduce(math.gcd, numbers)

num = int(input())
list = []
for i in range(1,num):
  for j in range(i,num):
    for k in range(j,num):
      list.add(gcd(i,j,k))
print(sum(list))

Fixed submission:
import math
from functools import reduce
 
def aaa(*numbers):
    return reduce(math.gcd, numbers)
 
num = int(input())
list = []
for i in range(1,num+1):
    for j in range(1,num+1):
        for k in range(1,num+1):
            list.append(aaa(i,j,k))
print(sum(list))
Buggy python submission (verdict: Runtime Error):
n=int(input())
a=list(map(int,input().split()))
l=1
for i in range(n):
    l*=a[i]
    if j>10**18:
        break
if l>10**18:
    print(-1)
else:
    print(l)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=1

for i in range(n):
    l*=a[i]
    if l>10**18:
        break
if min(a)==0:
    print(0)
elif l>10**18:
    print(-1)
else:
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
l=1
for i in range(n):
    l*=a[i]
if l>10**18:
    print(-1)
else:
    print(l)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=1

for i in range(n):
    l*=a[i]
    if l>10**18:
        break
if min(a)==0:
    print(0)
elif l>10**18:
    print(-1)
else:
    print(l)

Buggy python submission (verdict: Time Limit Exceeded):
n=int(input())
a=list(map(int,input().split()))
l=1
for i in range(n):
    l*=a[i]
if l>10**18:
    print(-1)
else:
    print(l)

Fixed submission:
n=int(input())
a=list(map(int,input().split()))
l=1

for i in range(n):
    l*=a[i]
    if l>10**18:
        break
if min(a)==0:
    print(0)
elif l>10**18:
    print(-1)
else:
    print(l)
Buggy python submission (verdict: Runtime Error):
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;

int main() {
    unsigned long long a,k;
    float b;
    cin>>a>>b;
    k=trunc(a*b);
    cout<<k;
    return 0;
}

Fixed submission:
import math
from decimal import *
getcontext().prec = 100
a,b=input().split()
a=int(a)
print(int(a*Decimal(b)))
Buggy python submission (verdict: Runtime Error):
N, K = map(int,input().split())
x = N%K
print(min(x,k-x))

Fixed submission:
N, K = map(int,input().split())

if N > K:
    x = N%K
else:
    x = K-N

while  N > x :
    N = x

    if N > K:
        x = N-K

    else:
        x = K-N

print(N)

Buggy python submission (verdict: Time Limit Exceeded):
N, K = map(int,input().split())

if N > K:
    x = N-K
else:
    x = K-N

while  N > x :
    N = x

    if N > K:
        x = N-K

    else:
        x = K-N

print(N)

Fixed submission:
N, K = map(int,input().split())

if N > K:
    x = N%K
else:
    x = K-N

while  N > x :
    N = x

    if N > K:
        x = N-K

    else:
        x = K-N

print(N)
Buggy python submission (verdict: Runtime Error):
H, W = map(int,input().split())

if (H==1 or W==1):
    print(0)
else:
    if (h!=0 and w !=0):
        print((2*(H//2)+1)*(W//2) + H//2+1)

    if (h==0 and w == 0):
        print((2*(H//2))*(W//2))

    if (h!=0 and w == 0):
        print((2*(H//2)+1)*(W//2))

    if (h ==0 and w !=0):
        print((2*(H//2))*(W//2) + H//2)

Fixed submission:
H, W = map(int,input().split())

if H==1 or W==1:
    print(1)
else:
    print((H*W+1)//2)
Buggy python submission (verdict: Runtime Error):
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

min = min(a)+min(b)

for i in range(M):
    c =list(map(int,input().split()))
    s = a[c[0]-1]+b[c[1]-1]-c[2]
    min = min(s,min)

print(min)


Fixed submission:
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))

min = min(a)+min(b)

for i in range(M):
    c =list(map(int,input().split()))
    s = a[c[0]-1]+b[c[1]-1]-c[2]
    min = (s if s < min else min)

print(min)
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
S = [0] * M
C = [0] * M
for i in range(M):
    S[i], C[i]= map(int, input().split())

if M==0:
  A = 10**(N-1)
else:
  A = 0

X = []
for j in range(M):
  if S[j] in X:
    X.append(S[j])
  else:
    A +=(10**((N-S[j])))*C[j]
    X.append(S[j])

str_B = list(str(A))

for k in range(M):
  if str_B[S[k]-1] != str(C[k]):
    A = -1

if A < 10**(N-1):
  A = -1

print(A)

Fixed submission:
N = int(input())
print(int(N/2) if N%2 == 0 else N//2+1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
X = list(map(int, input().split()))

MaxX = max(X)
MinX = min(X)

ListP = []

for i in range(MinX, MaxX):
    P = 0
    for j in range(N):
        P += (X[j]-i)**2
    
    ListP.append(P)

print(min(ListP))

Fixed submission:
N, R= map(int,input().split())

print( R if N >=10 else R+100*(10-N))
Buggy python submission (verdict: Runtime Error):
N = int(input())
X = list(map(int, input().split()))

MaxX = max(X)
MinX = min(X)

ListP = []

for i in range(MinX, MaxX):
    P = 0
    for j in range(N):
        P += (X[j]-i)**2
    
    ListP.append(P)

print(min(ListP))

Fixed submission:
N = int(input())
X = list(map(int,input().split()))

a = min(X)
b = max(X)

ans = []

for i in range(a,b+1):
  S = 0
  for j in range(N):
    S += (X[j]-i)**2

  ans.append(S)
  
print(min(ans))
Buggy python submission (verdict: Runtime Error):
N = int(input())
list = [int(i) for i in input().split()]
a = 0

for i in range(N):
  if min(list[:i+1]) >= list[i]:
    a += 1
    
print(a)

Fixed submission:
a, b = input().split()

if a == b :
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list = list(map(int,input().split()))
a = 0

for i in range(N):
  if min(list[:i+1]) >= list[i]:
    a += 1
    
print(a)

Fixed submission:
N = int(input())
list = list(map(int,input().split()))
a = 0
min = list[0]

for i in range(N):
  if min >= list[i]:
    min = list[i]
    a += 1
    
print(a)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
list = [int(i) for i in input().split()]
a = 0

for i in range(N):
  if min(list[:i+1]) >= list[i]:
    a += 1
    
print(a)

Fixed submission:
N = int(input())
list = list(map(int,input().split()))
a = 0
min = list[0]

for i in range(N):
  if min >= list[i]:
    min = list[i]
    a += 1
    
print(a)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int,input().split()))

B = sorted(A)

for i in range(N):
    print(A.index(B[i])+1)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))

B = [0]*N

for i in range(N):
    B[A[i]-1] = str(i+1)

print(' '.join(B))
Buggy python submission (verdict: Runtime Error):
A, B = map(int,input().split())

def main():
    print(B//A+ (1 if B%A > 0 else 0)

if __name__ == '__main__':
    main()

Fixed submission:
A, B = map(int,input().split())

print((B-1-1)//(A-1)+1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
V = sorted(list(map(int,input().split())))



for i in range(N-1):
    V[0] = (V[0] + V.pop(1))/2

print(V[0])

Fixed submission:
a = int(input())
s = input()

print( s if a >= 3200 else "red")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
import copy
A = [int(input()) for _ in range(N)]
for i in range(N):
    B = copy.copy(A)
    B.remove(B[i])
    print(max(B))

Fixed submission:
N = int(input())
A = [int(input()) for _ in range(N)]
a = max(A)
i = A.index(a)

import copy
B = copy.copy(A)
B.remove(a)

for j in range(N):
    if j == i:
        print(max(B))
    else:
        print(a)
Buggy python submission (verdict: Runtime Error):
N, M = map(int,input().split())

L,R= map(int,input().split())

for i in range(M):
    x,y= map(int,input().split())
    L = max(L,x)
    R = min(R,y)

print(R-L+1)

Fixed submission:
N, M = map(int,input().split())

L,R= map(int,input().split())

for i in range(M-1):
    x,y= map(int,input().split())
    L = max(L,x)
    R = min(R,y)

print(R-L+1 if L<=R else 0)
Buggy python submission (verdict: Runtime Error):
S = list(input())

c = 0
ans = 0

for i in S:
    if i=='A' or i=='C' or i=='G' or i=='T':
        c += 1
        if ans < c:
        ans = c
    else:
        c = 0

print(ans)

Fixed submission:
S = list(input())

c = 0
ans = 0

for i in S:
    if i=='A' or i=='C' or i=='G' or i=='T':
        c += 1
        if ans < c:
            ans = c
    else:
        c = 0

print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
W = list(input())
a = 'Yes'

s = W[0]

for i in range(N-1):
    k = input()
    if s[-1]==k[0] and k not in W:
        W.append(k)
        s = W[-1]
    else:
        a = 'No'
        for j in range(N-i):
            k = input()
        break


print(a)

Fixed submission:
N = int(input())
W =[ input()]
a = 'Yes'

for i in range(1,N):
    k = input()
    W.append(k)
    if W[-2][-1]!=k[0] or len(set(W))!=(i+1):
        a = 'No'
        break

print(a)
Buggy python submission (verdict: Time Limit Exceeded):
A,B,C,K = map(int,input().split())

for i in range(K):
    T = B + C
    N = A + C
    H = A + B
    if (T==N) and (N==H):
        break
    else:
        A = T
        B = N
        C = H

print( A-B if abs(A-B)<= 10**18 else 'Unfair')

Fixed submission:
A,B,C,K = map(int,input().split())
a = (A-B)*(-1)**(K%2)
print(a if abs(a)<10**18 else "Unfair")
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())

ans = 0

while (A%2 == 0) & (B%2 == 0) & (C%2 == 0):
    if (A==B) & (B==C) :
        ans = -1
        break

    a = (B+C)/2
    b = (A+C)/2
    c = (A+B)/2
    A = a
    B = b
    C = c
        ans += 1

print(ans)

Fixed submission:
A,B,C = map(int,input().split())

ans = 0

while (A%2 == 0) & (B%2 == 0) & (C%2 == 0):
    if (A==B) & (B==C) :
        ans = -1
        break

    a = (B+C)/2
    b = (A+C)/2
    c = (A+B)/2
    A = a
    B = b
    C = c
    ans += 1

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))
t = 1
for i in range(n):
    t = t*a[i]
    if t == 0:
        print("0", end="")
        exit()
if t > 10**18:
    print("-1", end="")
    exit()
print(t, end="")


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
t = 1
if 0 in a:
    print("0", end="")
    exit()

for i in range(n):
    t = t*a[i]
    if t > 10**18:
        print("-1", end="")
        exit()
print(t, end="")
Buggy python submission (verdict: Runtime Error):
l = [int(i) for i in input().split(' ')]
if (l[0] < l[2]) && ((l[1] > l[2]):
    print('Yes')
else:
    print('No')

Fixed submission:
l = [int(i) for i in input().split(' ')]
if ((l[0] < l[2]) and (l[2] < l[1])) or ((l[1] < l[2]) and (l[2] < l[0])):
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' ')
    print sum(line)-(line[x[0]]-x[1])

Fixed submission:
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' '))
    s = sum(line)-(line[x[0]-1]-x[1])
    print s

Buggy python submission (verdict: Runtime Error):
N = int(raw_input())
line = raw_input().split(' ')
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' ')
    print sum(line)-(line[x[0]]-x[1])

Fixed submission:
N = int(raw_input())
line = map(int,raw_input().split(' '))
M = int(raw_input())
for i in range(M):
    x = map(int,raw_input().split(' '))
    s = sum(line)-(line[x[0]-1]-x[1])
    print s
Buggy python submission (verdict: Runtime Error):
a = raw_input()
a.split(' ')
for i in range(a[0]):
    a = raw_input()
    print a
    print a

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

Buggy python submission (verdict: Runtime Error):
while 1:
    a = raw_input()
    if a == '':
        break
    if a == 'a' or a=='i' or a=='u' or a=='e' or a=='o':
        print 'vowel'
    else:
        print 'consonant'


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