import java.io.*;

/**
 * This program computes the sum and the product of numbers from 1 to N.
 * Iteratively and recursively
 */

class SumProd
{
    public static void main (String[] args)
    {
     int n; // GIVENS, an integer n
     System.out.println( "Enter the number n:" );
     n = ITI1120.readInt( );
          
     System.out.println( "The iterative sum is " + sum(n) );
     System.out.println( "The recursive sum is " + sum_rec(n) );
     System.out.println( "The iterative product is " + prod(n) );
     System.out.println( "The recursive product is " + prod_rec(n) );

    }
    
// iterative sum    
  public static int sum(int n)
  {
   int sum = 0;
   int i;
        
   for (i=1; i <= n; i++)
    {
     sum =  sum + i; 
    }  
   return sum;
  }  
  
// recursive sum 
  public static int sum_rec(int n)
  { 
   int sum;
    
   if (n == 1) 
    {  
     sum = 1; 
    }    
   else
    {
     sum =  sum_rec(n-1) + n; 
    }  
   return sum;
  }  

// iterative product  
  public static int prod(int n)
  {
   int p = 1;
   int i;
        
   for (i=1; i <= n; i++)
    {
     p =  p * i; 
    }  
   return p;
  }  
  
// recursive product  
  public static int prod_rec(int n)
  {
   int p; 
    
   if (n == 1) 
    {  
     p = 1; 
    }    
   else
    {
     p =  prod_rec(n-1) * n; 
    }  
   return p;
  }  
}