#include <iostream>

#include <vector>

#include <map>

using namespace std;

struct Point {

    int x;

    int y;

    Point(): x(), y() {}

    Point(int a, int b): x(a), y(b) {}

};

class Solution {

public:

    int maxPoints(vector<Point> &points) {

        if (points.size() < )

            return points.size();

        int result = ;

        for (int i = ; i < points.size(); i++) {

            map<pair<int, int>, int> line;

            int overlap = , vertical = , curMax = ;

            for (int j = i + ; j < points.size(); j++)    {

                if((points[i].x == points[j].x) &&

                   (points[i].y == points[j].y)) {

                    overlap ++;

                    continue;

                }

                else if (points[i].x == points[j].x) {

                    vertical ++;

                }

                else {

                    int dx = points[i].x - points[j].x;

                    int dy = points[i].y - points[j].y;    

                    int gcd = GCD(dx, dy);

                    dx /= gcd;

                    dy /= gcd;

                    line[make_pair(dx, dy)]++;

                    curMax = max(line[make_pair(dx, dy)], curMax);

                }

                curMax = max(vertical, curMax);

            }

            result = max(result, curMax+overlap+);

        }

        return result;

    }

    int GCD(int a, int b) {

        if (b == )

            return a;

        return GCD(b, a%b);

    }

};

int main() {

    vector<Point> points;

    points.push_back(Point(, ));

    points.push_back(Point(, ));

    points.push_back(Point(, ));

    Solution *solution = new Solution();

    cout << solution->maxPoints(points) << endl;

    // (3,10),(0,2),(0,2),(3,10)

    vector<Point> points2;

    points2.push_back(Point(, ));

    points2.push_back(Point(, ));

    points2.push_back(Point(, ));

    points2.push_back(Point(, ));

    cout << solution->maxPoints(points2) << endl;

    return ;

}