# include 
# include 

int diff(char n[])
{
	int i;
	for(i=0;i<100;i++)
	{
		if((n[i] == ' ')||(n[i]=='\0'))
			break;
	}
	return i;
}

int less(char n[])
{
	int i[2], j, o=0;
	for(j=0;j<2;j++)
	{
		for(i[j]=0;n[o]!='\0';i[j]++)
		{
			if(n[o]==' ')
				break;
			o++;
		}
		o++;
	}
	if(i[0]i[1])
		return 1;
	else
		return 2;
}

int problem(int y, char a[])
{
	char one[100]={'\0'}, two[100]={'\0'}, three[100]={'\0'}, four[100]={'\0'}, thn[100]={'\0'};
	one[0] = a[0];
	int i, j=1, k;
	for(i=1;a[i] != '\0';i++)
	{
		if(a[i] != a[i-1])
		{
			one[j] = a[i];
			j++;
		}
	}
	two[0] = one[0];
	j = 1;
	for(i=1;one[i]!='\0';i++)
	{
		if((one[i]!='A')&&(one[i]!='E')&&(one[i]!='I')&&(one[i]!='O')&&(one[i]!='U'))
		{
			two[j] = one[i];
			j++;
		}
	}
	k = diff(two);
	j = 0;
	for(i=0;ithn[w+1])
				m = w+1;
			else
				m = 0;
			for(i=0;i