#include <cstdio>
#include <iostream>
#include <set>

using namespace std;

int x[101];
int y[101];

int n;



set <pair < double, double > > k;
set < int > xs;
int main (void){

    scanf( "%d", &n );
    int tmp, tm;

    tmp = tm = 0;

    for( int i = 0; i < n; ++i )
      cin >> x[i] >> y[i];

    for( int i = 0; i < n; ++i ){
      for( int j = i+1; j < n; ++j ){
        if( x[i] == x[j] ){ xs.insert( x[i] ); continue; }
        double k1 = ( y[j] - y[i] ) / ( x[j] - x[i] );
        double b = -k1 * x[i] + y[i];
        k.insert( make_pair ( k1, b ) );
      }
    }

    printf( "%d\n", k.size() + xs.size() );


    return 0;
}