/* MAX: return the maximum of n integers

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)         (max)

TRY TO GET AS MANY FEASABLE INDEPENDENT PATHS AS POSSIBLE.

*/

#include <stdio.h>
#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.

int debug = 0;

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

int max(int n) {
int max, i, a;
  
  max= -INF; i = 1; 
  
  while (i<=n) {  
    scanf("%d",&a);
    
    if (a>max) {

      max= a;

    }

    i++;

  } 

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