/* Display Triangle as follow
   0
   1 0
   1 0 1
   0 1 0 1 */
class Output2{
	public static void main(String args[]){
		for(int i=1;i<=4;i++){
			for(int j=1;j<=i;j++){
				System.out.print(((i+j)%2)+" ");
			}
			System.out.print("\n");
		}
	}
}

/* Display Triangle as follow : BREAK DEMO.
   1
   2 3
   4 5 6
   7 8 9 10 ... N */
class Output1{
	public static void main(String args[]){
		int c=0;
		int n = Integer.parseInt(args[0]);
loop1: for(int i=1;i<=n;i++){
loop2: for(int j=1;j<=i;j++){
	       if(c!=n){
		       c++;
		       System.out.print(c+" ");
	       }
	       else
		       break loop1;
       }
       System.out.print("\n");
       }
	}
}

class EvenOdd_Avg{
	public static void main(String args[]){
		int n = Integer.parseInt(args[0]);
		int cntEven=0,cntOdd=0,sumEven=0,sumOdd=0;
		while(n > 0){
			if(n%2==0){
				cntEven++;
				sumEven = sumEven + n;
			}
			else{
				cntOdd++;
				sumOdd = sumOdd + n;
			}
			n--;
		}
		int evenAvg,oddAvg;
		evenAvg = sumEven/cntEven;
		oddAvg = sumOdd/cntOdd;
		System.out.println("Average of first N Even no is "+evenAvg);
		System.out.println("Average of first N Odd no is "+oddAvg);
	}
}

/* Write a program to generate Harmonic Series.
   Example :
   Input - 5
   Output - 1 + 1/2 + 1/3 + 1/4 + 1/5 = 2.28 (Approximately) */
class HarmonicSeries{
	public static void main(String args[]){
		int num = Integer.parseInt(args[0]);
		double result = 0.0;
		while(num > 0){
			result = result + (double) 1 / num;
			num--;
		}
		System.out.println("Output of Harmonic Series is "+result);
	}
}

/* switch case demo
   Example :
   Input - 124
   Output - One Two Four */
class SwitchCaseDemo{
	public static void main(String args[]){
		try{
			int num = Integer.parseInt(args[0]);
			int n = num; //used at last time check
			int reverse=0,remainder;
			while(num > 0){
				remainder = num % 10;
				reverse = reverse * 10 + remainder;
				num = num / 10;
			}
			String result=""; //contains the actual output
			while(reverse > 0){
				remainder = reverse % 10;
				reverse = reverse / 10;
				switch(remainder){
					case 0 :
						result = result + "Zero ";
						break;
					case 1 :
						result = result + "One ";
						break;
					case 2 :
						result = result + "Two ";
						break;
					case 3 :
						result = result + "Three ";
						break;
					case 4 :
						result = result + "Four ";
						break;
					case 5 :
						result = result + "Five ";
						break;
					case 6 :
						result = result + "Six ";
						break;
					case 7 :
						result = result + "Seven ";
						break;
					case 8 :
						result = result + "Eight ";
						break;
					case 9 :
						result = result + "Nine ";
						break;
					default:
						result="";
				}
			}
			System.out.println(result);
		}catch(Exception e){
			System.out.println("Invalid Number Format");
		}
	}
}

/* Write a program to find whether no. is palindrome or not.
   Example :
   Input - 12521 is a palindrome no.
   Input - 12345 is not a palindrome no. */
class Palindrome{
	public static void main(String args[]){
		int num = Integer.parseInt(args[0]);
		int n = num; //used at last time check
		int reverse=0,remainder;
		while(num > 0){
			remainder = num % 10;
			reverse = reverse * 10 + remainder;
			num = num / 10;
		}
		if(reverse == n)
			System.out.println(n+" is a Palindrome Number");
		else
			System.out.println(n+" is not a Palindrome Number");
	}
}

/*Write a program to find whether given no. is Armstrong or not.
  Example :
  Input - 153
  Output - 1^3 + 5^3 + 3^3 = 153, so it is Armstrong no. */
class Armstrong{
	public static void main(String args[]){
		int num = Integer.parseInt(args[0]);
		int n = num; //use to check at last time
		int check=0,remainder;
		while(num > 0){
			remainder = num % 10;
			check = check + (int)Math.pow(remainder,3);
			num = num / 10;
		}
		if(check == n)
			System.out.println(n+" is an Armstrong Number");
		else
			System.out.println(n+" is not a Armstrong Number");
	}
}