import java.util.*; public class number_world { static number_world obj = new number_world(); public static void main(String args[]) { int n; Scanner in= new Scanner(System.in); n=in.nextInt(); System.out.println("enter a number = "+n); obj.pronic(n); obj.bouncy(n); obj.wasteful(n); obj.harmonic(n); obj.odious(n); obj.neon(n); obj.palindrome(n); obj.adam(n); obj.triangular(n); obj.frugal(n); obj.fascinating(n); obj.ugly(n); obj.kaprekar(n); obj.keith(n); obj.happy(n); } void bouncy(int n) { int i,d,d1,j,c=0,increase=0,same=0,decrease=0,y; y=n; d=n%10; n=n/10; while(n!=0) { d1=n%10; n=n/10; c++; if(d==d1) same++; else if(d>d1) increase++; else if(dd) System.out.println(n+" is a wasteful number"); else System.out.println(n+" is an economical number"); } boolean palin(int n) { int rn=0,y=n; while(y!=0) { rn=rn*10+(y%10); y=y/10; } if(n==rn) return(true); else return(false); } int palind(int n) { int rn=0,y=n; while(y!=0) { rn=rn*10+(y%10); y=y/10; } return(rn); } boolean prime(int n) { int i,c=0; for(i=1;i<=n;i++) { if(n%i==0) c++; } if(c==2) return(true); else return(false); } int digitcounter(int n) { int c=0; while(n!=0) { c++; n/=10; } return(c); } void odious(int n) { int y=n,bn=0,d,c=0; while(n!=0) { d=n%2; n/=2; bn=(bn*10)+d; } while(bn!=0) { d=bn%10; bn/=10; if(d==1) c++; } if(c%2==1) System.out.println(y+" is an odious number"); else System.out.println(y+" is an evil number"); } void neon(int n) { int sq,s=0; sq=n*n; while(sq!=0) { s=s+(sq%10); sq=sq/10; } if(s==n) System.out.println(n+" is a neon number"); } void frugal(int n) { int d,y,i,c,d1=0; boolean b; d=obj.digitcounter(n); y=n; for(i=1;i<=n;i++) { b=obj.prime(i); if(b==true) { if(n%i==0) d1++; c=0; while(n%i==0) { c++; n=n/i; } if(c>1) d1++; } } if(d>d1) System.out.println(y+" is a frugal number"); } void fascinating(int n) { String s; char c; int i,j,length,p1,p2,numbercount=0; if(n>99) { p1=n*2; p2=n*3; s=""+p1+p2+n; length=s.length(); for(i=1;i<=9;i++) { int count=0; for(j=0;j=0;i--) { ar[i] = n1%10; n1/=10; } for(i=0;i9); if(i==1) System.out.println(n+"is a happy number"); } }