#include <stdio.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>

int main() {
int n,counter = 0;
 int i,j;
    void insertion_sort(int*,long);
    scanf("%d",&n);
int arr[n];
    for( i = 0; i<n; i++)
        {
        scanf("%d",&arr[i]);
    }
    insertion_sort(arr,n);
    for( i = 0;i<n; i++){
        for( j = i;j<n;j++){
            if((arr[i]*arr[j])<arr[n-1])
                counter++;
        }
    }
    printf("213");
    return 0;
}
void insertion_sort (int *items, long count)
{
  register long a, b;
  long t;
  for(a=1; a < count; ++a)
    {     t = items[a];
  for(b=a-1; (b >= 0) && (t < items[b]); b--)
        items[b+1] = items[b];
        items[b+1] = t;
     }
}