#include <bits/stdc++.h>
using namespace std;

#define int long long
#define P pair<int,int>
#define debug(x) cerr << #x << ": " << x << '\n'
#define dg(x)  cout << #x << " = " << x << '\n'
#define ct(x)   cout<<x<<'\n'
#define cct(x,y)  cout<<x<<' '<<y<<'\n'
#define ll long long
#define double long double
const int N = 2e5 + 5, mod = 1e9 + 7, inf = 1e17;


double dis(P a, P b){
    return sqrt((a.first - b.first) * (a.first - b.first) + (a.second - b.second) * (a.second - b.second));
}

bool ok(P a, P b, P c){
     int x1=b.first-a.first,y1=b.second-a.second;
     int x2=c.first-a.first,y2=c.second-a.second;
     return x1*y2==x2*y1;
}
std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());
 
inline int rands(int x) {
    return (1ull * rng() * rng() % x + x)%x + 1;
}
inline void run(){
    int n;
    while(cin >> n){
        vector<P> a(n + 1);
        for(int i=1;i<=n;i++){
            cin >> a[i].first >> a[i].second;
        }
        if(n <= 2){
            cout << n << '\n';
            return;
        }
        
        int res = 0;
        for(int op = 1;op <= 100;op ++){
            int u = rands(n);
            int v = rands(n);
            while(u == v) v = rands(n);

            int cnt = 0;
            for(int i=1;i<=n;i++){
                cnt += ok(a[u], a[v], a[i]);
            }
            res = max(res, cnt);
        }
        
        cout << max(n % 3, res - 2 * (n - res)) << '\n';
    }
}
signed main(){
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(0),std::cout.tie(0);

    // int T; std::cin>>T; while(T--)
    run(); return 0;
}