#include<algorithm> #include<iostream> #include<cstdio> #include<cmath> #define N 201 #define inf 1e20 #define eps 1e-8 using namespace std; int n,tot,ans; double x[N],y[N],k[40000]; int main(){ scanf("%d",&n); for(int i=1;i<=n;i++) scanf("%lf%lf",&x[i],&y[i]); for(int i=1;i<=n;i++) for(int j=i+1;j<=n;j++) if(x[i]!=x[j])k[++tot]=(y[j]-y[i])/(x[j]-x[i]); else k[++tot]=inf; sort(k+1,k+tot+1); for(int i=1;i<=tot;i++) if(fabs(k[i]-k[i-1])>eps)ans++; printf("%d",ans); return 0; }