stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <algorithm>

#include <iostream>

#include <string>

using namespace std;

typedef long long i64;



i64 result;

int N;

int cnt[30];

string str;



int main(int argc, char **argv)

{

	cin >> str ;

	for(const char & x : str)

		cnt[x - 'a']++, N++;



	result = 1LL * N * (N - 1) / 2 + 1;

	for(const int & x : cnt)

		if(x != 0)

			result -= 1LL * x * (x - 1) / 2;

	cout << result << endl ;

	return 0;

}




// Faster C++ solution for the same problem (measured speedup: 5.271851214432068x):
#include<cstdio>

#include<cstring>

#include<algorithm>

using namespace std;



typedef long long ll;

const int MAXN=2e5+5;



int n;

ll d[MAXN],cnt[30],sum;

char s[MAXN];



int main(){

    scanf("%s",s+1);

    n=strlen(s+1);

    d[1]=1,sum=1,cnt[s[1]-'a']=1;

    for(int i=2;i<=n;i++){

        d[i]=(ll)d[i-1]+sum-cnt[s[i]-'a'];

        cnt[s[i]-'a']++;

        sum++;

    }

    printf("%lld",d[n]);

}
// Slower C++ solution:
#include "bits/stdc++.h"

using namespace std;



#define OUT(x)  cerr << #x << " = " << x << endl;

#define all(x)  x.begin(), x.end()

#define mp      make_pair

#define pii     pair<int, int>

#define pll     pair<long long, long long>

#define ll      long long



//long long extgcd(long long a, long long b, long long& x, long long& y) { //拡張gcdによる逆元

//        long long d = a;

//        if (b != 0) {

//                d = extgcd(b, a % b, y, x);

//                y -= (a / b) * x;

//        } else {

//                x = 1;

//                y = 0;

//        }

//        return d;

//}

//long long inv(long long a) {

//        long long x, y;

//        extgcd(a, MOD, x, y);

//        return (x % MOD + MOD) % MOD;

//}

//long long inv(long long a) { //フェルマーの小定理と繰り返し2乗法による逆元

//        long long res = 1;

//        long long n = MOD - 2;

//        while (n > 0) {

//                if (n & 1) res = res * a % MOD;

//                a = a * a % MOD;

//                n >>= 1;

//        }

//        return res;

//}

//

//long long nCr(long long n, long long r) {

//        if (n < r) return 0;

//        if (n - r < r) r = n - r;

//        long long ret = 1;

//        for (int i = 0; i < r; i ++) {

//                ret = ret * n % MOD;

//                n --;

//                ret = ret * inv(i + 1) % MOD;

//        }

//        return ret;

//}

long long fact[202020];

long long nCr(long long n, long long r){

        long long ans = fact[n];

        ans /= fact[r] * fact[n - r];

        return ans;

}



//long long nHr(long long n, long long r) { //n個のものから重複を許してr個をとる場合の数

//        return nCr(n + r - 1, r);

//}



void init() {

        fact[0] = 1;

        for (int i = 1; i < 202020; i ++) fact[i] = fact[i - 1] * i;

}



int main() {

        init();

        string s;

        cin >> s;

        vector<long long> cnt(26, 0);

        long long n = s.size();

        for (int i = 0; i < n; i ++) {

                cnt[s[i] - 'a'] ++;

        }

        long long ans = 1;

        ans += n * (n - 1) / 2;

        for (int i = 0; i < 26; i ++) {

                if (cnt[i] < 2) continue;

                ans -= cnt[i] * (cnt[i] - 1) / 2;

        }

        cout << ans << endl;

        return 0;

}




// Faster C++ solution for the same problem (measured speedup: 2.632156847232367x):
#include "bits/stdc++.h"

using namespace std;



int main() {

        string s; cin >> s;

        vector<long long> cnt(26, 0);

        long long n = s.size();

        for (int i = 0; i < n; i ++) cnt[s[i] - 'a'] ++;

        long long ans = 1 + n * (n - 1) / 2;

        for (int i = 0; i < 26; i ++) if (cnt[i] >= 2) ans -= cnt[i] * (cnt[i] - 1) / 2;

        cout << ans << endl;

        return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>



using namespace std;



typedef long long ll;

ll a, b, x, ans;



int main(){

	char c;

	while(~scanf("%c", &c)){

		getchar();

		if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

			cout << "vowel" << endl;

		else

			cout << "consonant" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.365520503653452x):
#include <cstdio>

main()

{

	char a;

	int k;

scanf("%c",&a);

k = a;

if(k==117||k==111||k==105||k==101||k==97)

{

printf("vowel\n");

}

else

{

	printf("consonant\n");

}

}
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<iostream>

#include<cmath>

#include<algorithm>

using namespace std;



int main()

{

	char c,a = 'a',e = 'e',i = 'i',o = 'o',u = 'u';

	scanf("%c",&c);

	if(c == a||c == e||c == i||c == o||c == u)

		printf("vowel");

	else printf("consonant");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.293132833347642x):
#include <cstdio>

main()

{

	char a;

	int k;

scanf("%c",&a);

k = a;

if(k==117||k==111||k==105||k==101||k==97)

{

printf("vowel\n");

}

else

{

	printf("consonant\n");

}

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>



using namespace std;



typedef long long ll;

ll a, b, x, ans;



int main(){

	char c;

	while(~scanf("%c", &c)){

		getchar();

		if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

			cout << "vowel" << endl;

		else

			cout << "consonant" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.365520503653452x):
#include <stdio.h> 

int main()

{

    char a;

    scanf("%c",&a);

    if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u'){

    	printf("vowel\n");

	}else{

		printf("consonant\n");

	}

    return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<iostream>

#include<cmath>

#include<algorithm>

using namespace std;



int main()

{

	char c,a = 'a',e = 'e',i = 'i',o = 'o',u = 'u';

	scanf("%c",&c);

	if(c == a||c == e||c == i||c == o||c == u)

		printf("vowel");

	else printf("consonant");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.293132833347642x):
#include <stdio.h> 

int main()

{

    char a;

    scanf("%c",&a);

    if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u'){

    	printf("vowel\n");

	}else{

		printf("consonant\n");

	}

    return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <string>

#include <map>

#include <iomanip>

#include <algorithm>

#include <queue>

#include <stack>

#include <set>

#include <vector>

//const int maxn = 1e5+5;

#define ll long long

#define MAX INT_MAX

#define FOR(i,a,b) for( int i = a;i <= b;++i)



using namespace std;

char c;



int main()

{

    cin>>c;

    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')

    {

        printf("vowel");

    }

    else

    {

        printf("consonant");

    }



}




// Faster C++ solution for the same problem (measured speedup: 5.332537906392415x):
#include <stdio.h> 

int main()

{

    char a;

    scanf("%c",&a);

    if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u'){

    	printf("vowel\n");

	}else{

		printf("consonant\n");

	}

    return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>



using namespace std;



typedef long long ll;

ll a, b, x, ans;



int main(){

	char c;

	while(~scanf("%c", &c)){

		getchar();

		if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

			cout << "vowel" << endl;

		else

			cout << "consonant" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.367048569072402x):
#include<stdio.h>

int main()

{

	char x;

	scanf("%c",&x);

	if(x==97||x==101||x==105||x==117||x==111)

	printf("vowel") ;

	else

	printf("consonant");

	return 0;

 }
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<iostream>

#include<cmath>

#include<algorithm>

using namespace std;



int main()

{

	char c,a = 'a',e = 'e',i = 'i',o = 'o',u = 'u';

	scanf("%c",&c);

	if(c == a||c == e||c == i||c == o||c == u)

		printf("vowel");

	else printf("consonant");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294640283227861x):
#include<stdio.h>

int main()

{

	char x;

	scanf("%c",&x);

	if(x==97||x==101||x==105||x==117||x==111)

	printf("vowel") ;

	else

	printf("consonant");

	return 0;

 }
// Slower C++ solution:
#include <iostream>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <string>

#include <map>

#include <iomanip>

#include <algorithm>

#include <queue>

#include <stack>

#include <set>

#include <vector>

//const int maxn = 1e5+5;

#define ll long long

#define MAX INT_MAX

#define FOR(i,a,b) for( int i = a;i <= b;++i)



using namespace std;

char c;



int main()

{

    cin>>c;

    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')

    {

        printf("vowel");

    }

    else

    {

        printf("consonant");

    }



}




// Faster C++ solution for the same problem (measured speedup: 5.334056578581711x):
#include<stdio.h>

int main()

{

	char x;

	scanf("%c",&x);

	if(x==97||x==101||x==105||x==117||x==111)

	printf("vowel") ;

	else

	printf("consonant");

	return 0;

 }
// Slower C++ solution:
#include<cstdio>

#include<iostream>



using namespace std;



typedef long long ll;

ll a, b, x, ans;



int main(){

	char c;

	while(~scanf("%c", &c)){

		getchar();

		if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

			cout << "vowel" << endl;

		else

			cout << "consonant" << endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.367048569072402x):
#include<stdio.h>

int main()

{

	char X,a,e,i,o,u;

	scanf("%c",&X);

	if(X=='a'||X=='e'||X=='i'||X=='o'||X=='u')

	{

		printf("vowel");

	}

	else

	{

		printf("consonant");

	}

	return 0;

}
// Slower C++ solution:
#include<cstdio>

#include<cstring>

#include<iostream>

#include<cmath>

#include<algorithm>

using namespace std;



int main()

{

	char c,a = 'a',e = 'e',i = 'i',o = 'o',u = 'u';

	scanf("%c",&c);

	if(c == a||c == e||c == i||c == o||c == u)

		printf("vowel");

	else printf("consonant");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.294640283227861x):
#include<stdio.h>

int main()

{

	char X,a,e,i,o,u;

	scanf("%c",&X);

	if(X=='a'||X=='e'||X=='i'||X=='o'||X=='u')

	{

		printf("vowel");

	}

	else

	{

		printf("consonant");

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cmath>

#include <cstdio>

#include <cstring>

#include <string>

#include <map>

#include <iomanip>

#include <algorithm>

#include <queue>

#include <stack>

#include <set>

#include <vector>

//const int maxn = 1e5+5;

#define ll long long

#define MAX INT_MAX

#define FOR(i,a,b) for( int i = a;i <= b;++i)



using namespace std;

char c;



int main()

{

    cin>>c;

    if(c=='a'||c=='e'||c=='i'||c=='o'||c=='u')

    {

        printf("vowel");

    }

    else

    {

        printf("consonant");

    }



}




// Faster C++ solution for the same problem (measured speedup: 5.334056578581711x):
#include<stdio.h>

int main()

{

	char X,a,e,i,o,u;

	scanf("%c",&X);

	if(X=='a'||X=='e'||X=='i'||X=='o'||X=='u')

	{

		printf("vowel");

	}

	else

	{

		printf("consonant");

	}

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

    char s;

    s = getchar();

    if(s=='a'||s=='e'||s=='i'||s=='o'||s=='u')

        printf("vowel\n");

    else printf("consonant\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.255913240226268x):
#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

int main(){

    char a[100];

    while(~scanf("%s",a)){

        if(a[0]=='a'||a[0]=='e'||a[0]=='i'||a[0]=='o'||a[0]=='u'){

            printf("vowel\n");

        }

        else{

            printf("consonant\n");

        }

    }

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

    char s;

    s = getchar();

    if(s=='a'||s=='e'||s=='i'||s=='o'||s=='u')

        printf("vowel\n");

    else printf("consonant\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.29703977850277x):
#include<stdio.h>

int main()

{

    char a;

    scanf("%c", &a);



    switch(a)

    {

    case 'a' :

        printf("vowel");

        break;

    case 'e' :

        printf("vowel");

        break;

    case 'i' :

        printf("vowel");

        break;

    case 'o' :

        printf("vowel");

        break;

    case 'u' :

        printf("vowel");

        break;

    default :

        printf("consonant");

        break;

    }

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<string>

using namespace std;

int main(){

    string str;

    while(cin >> str){

        if(str[0] == 'a' || str[0] == 'e' ||str[0] == 'i' ||str[0] == 'o'||str[0] == 'u'){

            cout << "vowel" << endl;

        }else cout << "consonant" << endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.411804432978799x):
#include<stdio.h>

int main()

{

    char a;

    scanf("%c", &a);



    switch(a)

    {

    case 'a' :

        printf("vowel");

        break;

    case 'e' :

        printf("vowel");

        break;

    case 'i' :

        printf("vowel");

        break;

    case 'o' :

        printf("vowel");

        break;

    case 'u' :

        printf("vowel");

        break;

    default :

        printf("consonant");

        break;

    }

    return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <cstring>

#include <algorithm>

#include <set>

using namespace std;

set<char> s;

int main()

{

    char str;

    while (cin>>str)

    {

     s.insert('a');s.insert('e');s.insert('i');

    s.insert('o'); s.insert('u');

    if (s.find(str)!=s.end())

        cout<<"vowel\n";

    else cout<<"consonant\n";

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.361339291139294x):
#include<stdio.h>

int main()

{

    char a;

    scanf("%c", &a);



    switch(a)

    {

    case 'a' :

        printf("vowel");

        break;

    case 'e' :

        printf("vowel");

        break;

    case 'i' :

        printf("vowel");

        break;

    case 'o' :

        printf("vowel");

        break;

    case 'u' :

        printf("vowel");

        break;

    default :

        printf("consonant");

        break;

    }

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

  char a;

  cin>>a;

  if(a=='a' || a=='e' || a=='i' || a=='o' ||a=='u')

    cout<<"vowel"<<endl;

  else

    cout<<"consonant"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.356087629104348x):
#include<stdio.h>

int main()

{

    char a;

    scanf("%c", &a);



    switch(a)

    {

    case 'a' :

        printf("vowel");

        break;

    case 'e' :

        printf("vowel");

        break;

    case 'i' :

        printf("vowel");

        break;

    case 'o' :

        printf("vowel");

        break;

    case 'u' :

        printf("vowel");

        break;

    default :

        printf("consonant");

        break;

    }

    return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

#include<string>

using namespace std;

int main(){

    char s;

    s = getchar();

    if(s=='a'||s=='e'||s=='i'||s=='o'||s=='u')

        printf("vowel\n");

    else printf("consonant\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.296072716594248x):
#include<cstdio>

#include<cmath>

#include<cstring>

#include<string>



using namespace std;



int main()

{

	char c;

	scanf("%c",&c);

	if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

	printf("vowel\n");

	else

	printf("consonant\n");

	return 0;

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<string>

using namespace std;

int main(){

    string str;

    while(cin >> str){

        if(str[0] == 'a' || str[0] == 'e' ||str[0] == 'i' ||str[0] == 'o'||str[0] == 'u'){

            cout << "vowel" << endl;

        }else cout << "consonant" << endl;

    }

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.410816418891243x):
#include<cstdio>

#include<cmath>

#include<cstring>

#include<string>



using namespace std;



int main()

{

	char c;

	scanf("%c",&c);

	if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

	printf("vowel\n");

	else

	printf("consonant\n");

	return 0;

}
// Slower C++ solution:
#include <cstdio>

#include <iostream>

#include <cstring>

#include <algorithm>

#include <set>

using namespace std;

set<char> s;

int main()

{

    char str;

    while (cin>>str)

    {

     s.insert('a');s.insert('e');s.insert('i');

    s.insert('o'); s.insert('u');

    if (s.find(str)!=s.end())

        cout<<"vowel\n";

    else cout<<"consonant\n";

    }



    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.360360490295062x):
#include<cstdio>

#include<cmath>

#include<cstring>

#include<string>



using namespace std;



int main()

{

	char c;

	scanf("%c",&c);

	if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

	printf("vowel\n");

	else

	printf("consonant\n");

	return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

  char a;

  cin>>a;

  if(a=='a' || a=='e' || a=='i' || a=='o' ||a=='u')

    cout<<"vowel"<<endl;

  else

    cout<<"consonant"<<endl;



}


// Faster C++ solution for the same problem (measured speedup: 5.35510978703757x):
#include<cstdio>

#include<cmath>

#include<cstring>

#include<string>



using namespace std;



int main()

{

	char c;

	scanf("%c",&c);

	if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

	printf("vowel\n");

	else

	printf("consonant\n");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

int main()

{

    char ch=getchar();

    (ch=='a' || ch=='e' || ch=='i' || ch=='o' || ch=='u') && cout<<"vowel"<<endl || cout<<"consonant"<<endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.316358849691815x):
#include<cstdio>

#include<cmath>

#include<cstring>

#include<string>



using namespace std;



int main()

{

	char c;

	scanf("%c",&c);

	if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u')

	printf("vowel\n");

	else

	printf("consonant\n");

	return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    cin>>a;

    if(a=='a'|| a=='e'|| a=='i'|| a=='o'|| a=='u' )cout<<"vowel";

    else cout<<"consonant";

}










// Faster C++ solution for the same problem (measured speedup: 6.49848425625232x):
#include<bits/stdc++.h>

using namespace std;

int main(){

    char c;

    cin>>c;

    if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u'){

        cout<<"vowel"<<endl;

    }

    else{

        cout<<"consonant"<<endl;

    }

    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    cin>>a;

    if(a=='a'|| a=='e'|| a=='i'|| a=='o'|| a=='u' )cout<<"vowel";

    else cout<<"consonant";

}










// Faster C++ solution for the same problem (measured speedup: 6.49848425625232x):
#include<iostream>



using namespace std;



int main()

{

    char ch;

    cin>>ch;

    if(ch == 'a' || ch == 'e' || ch == 'i' || ch == 'o' || ch == 'u') cout<<"vowel"<<endl;

    else cout<<"consonant"<<endl;

    return 0;

}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 200005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>::iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];





int main()

{

    char a;

    cin>>a;

    if(a=='a'|| a=='e'|| a=='i'|| a=='o'|| a=='u' )cout<<"vowel";

    else cout<<"consonant";

}










// Faster C++ solution for the same problem (measured speedup: 6.512582919761286x):
#include<iostream>

using namespace std;

int main()

{

    char c;

    cin>>c;

    if(c=='a' || c=='e' || c=='i' || c=='o' || c=='u')

        cout<<"vowel";

    else

        cout<<"consonant";

    return 0;

}
// Slower C++ solution:
#include<iostream>

using namespace std;

int main()

{

    char n;

    cin>>n;

    if(n=='a'||n=='e'||n=='i'||n=='o'||n=='u')

    {

        cout<<"vowel";

    }

    else

    {

        cout<<"consonant";

    }

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.343460523929238x):
#include "cstdio"

signed main()

{

	char c=getchar();

	printf(c!='a'&&c!='e'&&c!='i'&&c!='o'&&c!='u'?"consonant\n":"vowel\n");

}
// Slower C++ solution:
#include<iostream>

#include<cstdio>

#include<algorithm>

using namespace std;

char ch;

int main()

{

    cin>>ch;

    if(ch=='a'||ch=='e'||ch=='i'||ch=='o'||ch=='u') cout<<"vowel";

    else cout<<"consonant";

    return 0; 

}

// Faster C++ solution for the same problem (measured speedup: 5.301333676676407x):
#pragma GCC optimize(s)

#include "stdio.h"

signed main()

{

	char c=getchar();

	printf(c!='a'&&c!='e'&&c!='i'&&c!='o'&&c!='u'?"consonant\n":"vowel\n");

}
// Slower C++ solution:
#include<cstdio>

#include<iostream>

using namespace std;

int main()

{

	char a;

	cin >> a;

	if(a=='a'||a=='e'||a=='i'||a=='o'||a=='u')

	{

		cout << "vowel" <<endl;

	}

	else

	{

		cout << "consonant" <<endl;

	}

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.365177430570105x):
#include <cstdio>



int main() {

	char ch;

	scanf("%c", &ch);

	if (ch == 'a' || ch == 'o' || ch == 'e' || ch == 'i' || ch == 'u')

		puts("vowel");

	else puts("consonant");

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    char x;

    cin >> x ;

    if (x=='a'||x=='e'||x=='o'||x=='i'||x=='u'||x=='A'||x=='E'||x=='O'||x=='U'||x=='I'){

        cout<<" vowel"<<endl;

    }else{

    cout<<"consonant"<<endl;

    }

       return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.364875751494056x):
#include <cstdio>



int main() {

	char ch;

	scanf("%c", &ch);

	if (ch == 'a' || ch == 'o' || ch == 'e' || ch == 'i' || ch == 'u')

		puts("vowel");

	else puts("consonant");

	return 0;

}