/* MINMAX: read n integers and determine both the min and max

Perform white box testing on the following code.

1. FLOWGRAPH
2. CYCLOMETRIC COMPLEXITY
3. BASIS SET OF CYCLES
4. LINEARLY INDEPENDENT PATHS   5. FEASABLE (YES/NO)   6. TEST CASES   7. RESULT
                                                            (n,a)        (min,max)

TRY TO GET AS MANY FEASABLE INDEPENDENT PATHS AS POSSIBLE.
*/

#define INF 999    // THIS REPRESENTS THE MACHINE PRECISION.
                   // NO ACTUAL INPUT CAN EVER EQUAL OR EXCEED THIS VALUE.
                   // YOU CANNOT USE 999, -999, 1100, etc.
                   // IT'S GOOD TO THINK LIKE A GRAPH THEORIST, BUT ALSO
                   // THINK LIKE A PROGRAMMER. IF YOU CAN TOUCH A NEW EDGE,
                   // THEN IT'S AN INDEPENDENT PATH.

#include <stdio.h>
int debug = 0;

/* instrumentation for the line #'s*/ 
int L(int i) { if (debug) printf("%d-",i); return 1; } 

void minmax(int *min, int *max) {
int i, n, a;

  *min = INF; *max = -INF; i=1; scanf("%d",&n);

  while (i<=n) {
    scanf("%d",&a); 
    if (a>*max) {
      
      *max=a;

    }

    if (a<*min) {
      
      *min=a;

    }
    i++;
  }

  if (debug) printf("\nActual : min=%d, max=%d\n",*min,*max); 
}
       
int main(int argc, char *argv[]) {
int min, max;
  if (argc > 1) {
    debug = 1;
    printf("Path   : ");
  }
  minmax(&min,&max); 
  printf("Minimum:%d  Maximum:%d\n",min,max);
}