#include <cstdio>

#include <string>

#include <cstdlib>

#include <cmath>

#include <iostream>

#include <cstring>

#include <set>

#include <queue>

#include <algorithm>

#include <vector>

#include <map>

using namespace std ;

typedef long long LL;

typedef pair<int, int> P;

const int INF = 0x3f3f3f3f;

const double inf = 0x3f3f3f3f3f3f3f;

const double eps = 1e-8;

const int maxn = 30000 + 5;

const int dr[] = {0, 0, -1, 1};

const int dc[] = {-1, 1, 0, 0};

int m, n;

inline bool is_in(int r, int c){

    return r >= 0 && r < n && c >= 0 && c < m;

}

int x[maxn], y[maxn];

set<double> sets;

int main(){

    while(scanf("%d", &n) == 1){

        sets.clear();

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

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

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

                if(x[i] == x[j])  sets.insert(inf);

                else  sets.insert((y[i]-y[j])*1.0/(x[i]*1.0-x[j]*1.0));

        printf("%d\n", sets.size());

    }

    return 0;

}