#include<stdio.h>

void q_sort(int numbers[], int left, int right){
    int pivot, l_hold, r_hold;

    l_hold = left;
    r_hold = right;
    pivot = numbers[left];
    while (left < right)
    {
        while ((numbers[right] >= pivot) && (left < right))
            right--;
        if (left != right)
        {
            numbers[left] = numbers[right];
            left++;
        }
        while ((numbers[left] <= pivot) && (left < right))
            left++;
        if (left != right)
        {
            numbers[right] = numbers[left];
            right--;
        }
    }
    numbers[left] = pivot;
    pivot = left;
    left = l_hold;
    right = r_hold;
    if (left < pivot)
        q_sort(numbers, left, pivot-1);
    if (right > pivot)
        q_sort(numbers, pivot+1, right);
}

int main(){
    int n,num[100]={0},i,sum;

    while(scanf("%d",&n),n){
        sum=0;
        for(i=0;i<n;i++){
            scanf("%d",&num[i]);
        }
        q_sort(num,0,n-1);
        for(i=1;i<n-1;i++)sum+=num[i];
        printf("%d\n",sum/(n-2));
    }
    return 0;
}