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

#define MAX	1024

float p[MAX];
int n;

int cmp(const void *a, const void *b)
{
	return *(float *)a - *(float *)b;
}

int test(int i, int j)
{
	int h = (j+1)/n;
	if (p[i] + 180 > p[(j+1) % n] + 360 * h)
		return 1;
	return 0;
}

int main(void)
{
	int i, k, sum;

	scanf("%d", &n);
	for (i=0; i<n; i++){
		scanf("%f", &p[i]);
	}

	qsort(p, n, sizeof(float), cmp);

	k = 0;
	while (test(0, k)) k++;
	
	sum = (k - 1) * k / 2;
	for (i=1; i<n; i++){
		while (test(i, k)) k++;
		sum += (k - i) * (k - i - 1) / 2;
	}

	printf("%d\n", n*(n-1)*(n-2)/6-sum);

	return 0;
}