#include <stdio.h>

#define N 10
typedef struct
{ 
    int high;
    int low;
} hilo;

hilo find(int a[], int n);

int main(void)
{
    int b[N], i;
    hilo result;
    
    printf("Enter %d numbers: ", N);
    for (i = 0; i < N; i++)
    {
        scanf("%d", &b[i]);
    }
    
    result = find(b, N);

    printf(" %d   %d\n", result.high, result.low);

    return 0;
}

/* Assume n >= 1 */
hilo find(int a[], int n)
{
    int i,j,k;
    hilo result;
    j = a[0];
    k = a[0];
    for (i = 1; i < n; i++)
    {
        printf(" %d ", a[i]);
        if (a[i] > j)
        {
            j = a[i];
        }
        else if (a[i] < k)
        {
            k = a[i];
        }      
    }
    result.high = j;
    result.low = k;
    return result;
}