codeforces 1284E

#include<bits/stdc++.h>

#define forn(i, n) for (int i = 0; i < int(n); i++)
#define fore(i, s, t) for (int i = s; i < (int)t; i++)
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define pf2(x,y) printf("%d %d\n",x,y)
#define pf(x) printf("%d\n",x)
#define each(x) for(auto it:x)	cout<<it<<endl;
#define pi pair<int,int>

using namespace std;

char inline nc(){
	static char buf[100000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,100000,stdin),p1==p2)?EOF:*p1++;
}

template <typename T>
bool rd(T& v){
	static char ch;
	while(ch!=EOF&&!isdigit(ch)) ch=nc();
	if(ch==EOF) return false;
	for(v=0;isdigit(ch);ch=nc())
		v=v*10+ch-‘0‘;
	return true;
}

template <typename T>
void o(T p){
	static int stk[70],tp;
	if(p==0) {
		putchar(‘0‘);return ;
	}
	if(p<0) {
		p=-p;putchar(‘-‘);
	}
	while(p) stk[++tp]=p%10,p/=10;
	while(tp) putchar(stk[tp--]+‘0‘);
}

typedef long long ll;

const int maxn=3e3+5;
const int maxm=4e5+5;
const int inf=1e9;

int n;

pi a[maxn];

ll C(ll n,ll m){
	if(m>n) return 0;
	if(n<0) return 0;
	if(m>n-m) m=n-m;
	ll ans=1;
	for(int i=1;i<=m;i++)
		ans*=n,ans/=i,n--;
	return ans;
}

ll cross(pi a,pi b){
	return 1ll*a.fi*b.se-1ll*b.fi*a.se;
}

int main(){
	cin>>n;
	for(int i=0;i<n;i++)
		cin>>a[i].fi>>a[i].se;
	ll tot=0;
	for(int i=0;i<n;i++){
		vector<pi> v;
		for(int j=0;j<n;j++)
			if(i!=j) v.push_back({a[j].fi-a[i].fi,a[j].se-a[i].se});
		sort(all(v),[&](pi x,pi y){
			bool b1=x<pi(0,0);
			bool b2=y<pi(0,0);
			if(b1!=b2) return b1<b2;
			return cross(x,y)>0;	
		});
		int j=0;
		for(int i=0;i<v.size();i++){
			while(j<i+v.size()&&cross(v[i],v[j%v.size()])>=0) j++;
			tot+=C(j-i-1,3);
		}
	}
	cout<<C(n,5)*5-tot<<endl;
}