#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

const double eps=1e-,inf=1e20;

const int maxn=;

int n,x[maxn],y[maxn],im=,m=;

double a[maxn];

int main()

{

    scanf("%d",&n);

    for(int i=;i<=n;i++)scanf("%d%d",&x[i],&y[i]);

    for(int i=;i<=n;i++)

        for(int j=i+;j<=n;j++)

            if(x[i]==x[j])a[++m]=inf;else a[++m]=1.0*(y[i]-y[j])/(x[i]-x[j]);

    sort(a+,a+m+);

    int ans=;

    for(int i=;i<=m;i++)if(fabs(a[i]-a[i-])>eps)ans++;

    printf("%d",ans);

    return ;

}