public class two
{
    // multiplication table.
    public static void mt()
    {
	int i, j;
	i = 2; // rows
	for(j=1;j<=9;j++)
	    {
			System.out.print(j+"\t");
	    }
        System.out.print("\n");
        while (i<=9)
	    {
		for(j=1;j<=i;j++)
		    {
			System.out.print(i*j+"\t");
		    }  // for j
		System.out.print("\n");
		i++;
	    } // while i
    } // mt

    public static void makechange()
    {
	int q, d, n, p;
        q=d=n=p=0;
        int c = 0;

   for(q=0;q<=4;q++)
   {
      for(d=0; (d*10)+(q*25)<=100  ;d++)
      {
	for (n=0;   (10*d)+(5*n)+(q*25)<=100   ;n++)
	    {
		p = 100 - (5*n) - (d*10) -(25*q);
		System.out.println(q+" quarters, "+d+
                  " dimes, "+n+" nickels and "+p+" pennies");
		c++;
	    } //nickel loop
      } // dimes loop
   } // quarters loop

   System.out.println("there are "+c+" different ways");
 }  //makechange


    public static int arraysum(int[] A)
    {
	int ax =0;
	/*
        for(int i=0;i<A.length;i++)
	    {
		ax = ax + A[i];	
	    }
	*/

	for(int x:A) { ax = ax + x; }  // foreach loop
        
	return ax;
    }

    // see if all numbers are odd:
    public static boolean allodd(int[] A)
    {
       boolean answer = true;
       for (int i=0;  i<A.length  && answer  ;i++)
	   {
	       if (A[i] % 2 == 0) answer = false;
	   }
       return answer;
    }

    public static boolean someneg(double[] A)
    {
	boolean answer = false;
	for(int i=0; i<A.length && !answer ;i++) if (A[i]<0) answer = true;
	return answer;
    }



    public static void main(String[] args)
    {
	//	mt();
	//	makechange();

	int[] A = new int[4];
        A[0] = 2;  A[1]=4; A[2]=6; A[3]=8;

	//   int[] A = {2, 4, 6, 8};
	int r = arraysum(A);
        System.out.println(r);

    }  // main
}  // two