//Written by Hung bayby & Chung crazy!

#include <stdio.h>
#include <conio.h>
#include "math.h"
long  maxS (long n);
int ktrasole(int n);
int daonguoc(int n);
int Amstrong(int n);
int n,N,max=0, temp=0,a[50];
int main()
{
	
	printf ("Nhap n: ");
	scanf("%d", &n);
	printf ("\n%d",maxS(n));
	if(ktrasole(n) == 1) printf("\nYes");
	else printf("\nNO");
	printf ("\n%d",daonguoc(n));
	for (int i=100;i<1000;i++)
	if(Amstrong(i) == i) printf("\n%d  ",i);
//-------------------------------------------------
//Tim phan tu lon nhi cua day
	printf ("Nhap N: ");
	scanf("%d", &N);
	for (int u=0;u<N;u++)
	{printf ("\na[%d] = ",u);scanf ("%d",&a[u]);}
	max=a[0];
	
	for (int k=1;k<N;k++)
	if (a[k]>max) max =a[k];

	temp = a[0];
	for (int j=1;j<N;j++)
	if (a[j]>temp && a[j]<max) temp=a[j];
	printf ("%d",temp);
//--------------------------------------------
	getch();
	return 0;
}
//----------------------------------------
//Ham kiem tra so lon nhat trong so?
long  maxS (long n)
{
	if (n==0) return max;
	if (n<10 && n>=max) return n;
	if (n%10>=max)
	{
		max=n%10;
		n=n/10;
		maxS(n);
	}
	else {n=n/10;maxS(n);}
	return max;

}
//--------------------------------------------
//Ham kiem tra so co toan chu so le hay khong?
int ktrasole(int n)
{
	if(n == 0) return 0;
	if (n < 10 && n%2 != 0)
		return 1;
	if((n%10)%2 ==0) return 0;
	return ktrasole(n/10);

}
//--------------------------------------------
//Ham dao nguoc so N bang de quy
int daonguoc(int n)
{
	if(n == 0) return temp;
	temp = temp*10 + n%10;
	return daonguoc(n/10) ;
}
//-------------------------------------------
//De quy kiem tra n co phai la so Amstrong
int Amstrong(int n)
{
	if (n<10) return pow(n,3);
	else return pow(n%10,3) + Amstrong(n/10);
}

//-------------------------------------------