#include<iostream>
#include<conio.h>
#include<stdio.h>
#include<stdlib.h>
using namespace std;
int f = 0;
int temp[1000];
int max (int[]);
int min (int[]);
bool search (int[]);
void increase (int[]);
int sum(int[]);
void eam(int[]);
void prime(int[]);
void mz(int[]);
void d(int[]);
void mp(int[]);
void inv(int[]);
void fac(int[]);
void sub2(int[]);
void mul(int[]);
void p(int[]);
void aa(int[]);
void bb(int[]);
void bt(int[]);
void barax(int[]);
void b29(int[]);

int main()
{
	int n;
	cout<<"Enter n for Array: ";
	cin>>n;
	f = n;
	int arr[1000];
	for (int i = 0; i<n; i++)
	{
		cout<<"Enter a number: ";
		cin>>arr[i];
		cout<<endl;
	}
	system("cls");
	//****Menu****
	cout<<"Select one of the following"<<endl;
	cout<<"1) Find Max"<<endl;
	cout<<"2) Find Min"<<endl;
	cout<<"3) Find a Number"<<endl;
	cout<<"4) Increasing Sort"<<endl;
	cout<<"5) Sum"<<endl;
	cout<<"6) Enheraf Az Miangin"<<endl;
	cout<<"7) Prime Numbers"<<endl;
	cout<<"8) Miangin e Zoj ha"<<endl;
	cout<<"9) 2 Digit Numbers"<<endl;
	cout<<"10) Miangin e Avval ha"<<endl;
	cout<<"11) Inverse of Numbers"<<endl;
	cout<<"12) Sum of Factorials"<<endl;
	cout<<"13) Subtract 2-2"<<endl;
	cout<<"14)zarb e Hameye Anasor"<<endl;
	cout<<"15)Print all the elements and indexes"<<endl;
	cout<<"16)Dovvomin onsore bozorg"<<endl;
	cout<<"17)Dovvomin onsore kuchek"<<endl;
	cout<<"18)Bishtarin Tekrar"<<endl;
	cout<<"19)Inverse The Array"<<endl;
	cout<<"20)Devidable to 2 and 9"<<endl;

	int ch;
	cin>>ch;
	//****Switch-Case****
	switch(ch)
	{
		case 1:
			cout<<max(arr)<<endl;
			break;
		case 2:
			cout<<min(arr)<<endl;
			break;
		case 3:
			if(search(arr))
				cout<<endl<<"The number is in the array"<< endl;
			else
				cout<<endl<<"The number is not in the array"<< endl;
			break;
		case 4:
			increase(arr);
			for (int i = 0; i< f ; i++)
				cout<<temp[i]<<endl;
			break;
		case 5:
			cout<<endl<<sum(arr)<<endl;
			break;
		case 6:
			eam(arr);
			for (int i = 0; i< f ; i++)
				cout<<temp[i]<<endl;
			break;
		case 7:
			prime(arr);
			break;
		case 8:
			mz(arr);
			break;
		case 9:
			d(arr);
			break;
		case 10:
			mp(arr);
			break;
		case 11:
			inv(arr);
			break;
		case 12:
			fac(arr);
			break;
		case 13:
			sub2(arr);
			break;
		case 14:
			mul(arr);
			break;
		case 15:
			p(arr);
			break;
		case 16:
			aa(arr);
			break;
		case 17:
			bb(arr);
			break;
		case 18:
			bt(arr);
			break;
		case 19:
			barax(arr);
			break;
		case 20:
			b29(arr);
			break;
	}

	getch();
}
int max (int a[])
{
	int m = a[0];
	for (int i = 1; i < f; i++)
	{
		if(a[i]>m)
			m = a[i];
	}
	return m;
}
int min (int a[])
{
	int m = a[0];
	for (int i = 1; i < f; i++)
	{
		if(a[i]<m)
			m = a[i];
	}
	return m;
}
bool search(int a[])
{
	int m;
	cout<<"Enter the number you want to search for: ";
	cin>>m;
	for(int i = 0; i<f; i++)
	{
		if(a[i] == m)
			return true;
	}
	return false;
}
void increase (int a[])
{
	int i= 0, hold = 0;
	for(int pass = 0; pass <f; pass++)
	{
		for(i = 0; i<f ; i++)
		{
			if(a[i]>a[i+1])
			{
				hold = a[i];
				a[i] = a[i + 1];
				a[i+1] = hold;
			}
		}
	}
	for(int i = 0; i< f; i++)
	{
		temp[i] = a[i];
	}
}
int sum(int a[])
{int sum = 0;
	if(f % 2 == 1)
	{
		for(int i = 0; i<= (f/2); i++)
		{
			sum += (a[i] + a[f-i]);
		}
	}
	else
	{
		for(int i = 0; i<= (f/2) - 1; i++)
		{
			sum += (a[i] + a[f-i]);
		}
		sum += a[(f/2)];
	}
	return sum;
}
void eam(int a[])
{
	float s = sum(a);
	float k = f;
	float m = s / k;
	for(int i = 0; i< f; i++)
	{
		temp[i] = a[i] - m;
	}
}
void prime(int a[])
{
	for(int i = 0; i<f; i++)
	{
		bool b = true;
		for(int j = 2; j<= a[i]/2; j++)
		{
			if(a[i] % j == 0)
				b = false;
		}
		if(b)
			cout<<a[i]<<endl;
	}
}
void mz(int a[])
{
	float s = 0;
	float c = 0;
	for(int i = 0; i<f; i++)
	{
		if(a[i]%2 == 0)
		{
			s += a[i];
			c++;
		}
	}
	cout<<s/c<<endl;
}
void d(int a[])
{
	for(int i = 0; i<f; i++)
	{
		if(a[i]>=10 && a[i] <= 99)
			cout<<a[i]<<endl;
	}
}
void mp(int a[])
{
	float s=0, c= 0;
	for(int i = 0; i<f; i++)
	{
		bool b = true;
		for(int j = 2; j<= a[i]/2; j++)
		{
			if(a[i] % j == 0)
				b = false;
		}
		if(b)
		{
			s+= a[i];
			c++;
		}
	}
	cout<<s/c<<endl;
}
void inv(int a[])
{
	for(int i = 0; i<f; i++)
	{
		while(a[i] > 0)
		{
			cout<<a[i]%10;
			a[i] = a[i]/10;
		}
		cout<<endl;
	}
}
void fac(int a[])
{
	int ss = 0;
	for(int i = 0; i<f; i++)
	{
		int s = 1;
		for (int t = 1; t<= a[i]; t++)
		{
			s = s * t;
		}
		ss += s;
	}
	cout<<ss<<endl;
}
void sub2(int a[])
{
	for(int i = 0; i<f; i+=2)
	{
		cout<<a[i] - a[i+1];
	}
}
void mul(int a[])
{
	int s = 1;
	for (int i = 1; i<f; i++)
	{
		s = s * a[i];
	}
	cout<<s<<endl;
}
void p(int a[])
{
	for (int i = 1; i<f; i++)
	{
		cout<<a[i]<<" ";
	}
	cout<<endl;
	for (int i = 1; i<f; i++)
		cout<<i<<" ";
}
void aa(int a[])
{
	increase(a);
	cout<<a[f-2];
}
void bb(int a[])
{
	int i= 0, hold = 0;
	for(int pass = 0; pass <f; pass++)
	{
		for(i = 0; i<f ; i++)
		{
			if(a[i]>a[i+1])
			{
				hold = a[i];
				a[i] = a[i + 1];
				a[i+1] = hold;
			}
		}
	}
	cout<<a[f-2]<<endl;
}
void bt(int a[])
{
	int c = 0;
	int index;
	int max = 0;
	for (int i = 0; i<f; i++)
	{
		for(int j = 0; j<f; j++)
		{
			if (a[i] == a[j])
				c++;
		}
		if(c>max)
		{
			max = c;
			index = i;
		}
	}
	cout<<"Index is: "<<index<<endl;
	cout<<"Number is: "<<a[index]<<endl;
}
void barax(int a[])
{
	for (int i = 0; i<f; i++)
	{
		cout<<a[f-i-1]<<" ";
	}
}
void b29(int a[])
{
	for (int i = 0; i< f; i++)
	{
		if(a[i] %2 == 0)
			if(a[i] % 9 == 0)
				cout<<a[i]<<" ";
	}
}