extern crate core;

use std::fmt;
use std::cmp::{Ordering, min, max};
use std::fmt::{Display, Error, Formatter};
use std::f32::MAX;
use std::ops::{Add, Sub, Mul, Div, Neg, Index, IndexMut};
use std::collections::BTreeMap;

fn show<T: Display>(vec: &Vec<T>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        print!("[{}", vec[0]);
        for i in 1 .. vec.len() {
            print!(", {}", vec[i]);
        }
        println!("]");
    }
}
fn show2<T: Display>(vec: &Vec<Vec<T>>) {
    if vec.is_empty() {
        println!("[]");
    }else {
        for l in vec {
            show(l);
        }
    }
}
macro_rules! read_line{
    () => {{
        let mut line = String::new();
        std::io::stdin().read_line(&mut line).ok();
        line
    }};
    (delimiter: ' ') => {
        read_line!().split_whitespace().map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (delimiter: $p:expr) => {
        read_line!().split($p).map(|x|x.to_string()).collect::<Vec<_>>()
    };
    (' ') => {
        read_line!(delimiter: ' ')
    };
    ($delimiter:expr) => {
        read_line!(delimiter: $delimiter)
    };
    (' '; $ty:ty) => {
        read_line!().split_whitespace().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
    ($delimiter:expr; $ty:ty) => {
        read_line!($delimiter).into_iter().map(|x|x.parse::<$ty>().ok().unwrap()).collect::<Vec<$ty>>()
    };
}
macro_rules! read_value{
    () => {
        read_line!().trim().parse().ok().unwrap()
    }
}
macro_rules! let_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}
macro_rules! let_mut_all {
    ($($n:ident:$t:ty),*) => {
        let line = read_line!(delimiter: ' ');
        let mut iter = line.iter();
        $(let mut $n:$t = iter.next().unwrap().parse().ok().unwrap();)*
    };
}
#[derive(Copy, Clone, Eq, PartialEq)]
struct Point {
    x: i32, y: i32
}
#[derive(Copy, Clone, Eq, PartialEq)]
struct Line {
    a: i32, b: i32, c: i32
}
impl Line {
    fn by_two_point(a: Point, b: Point) -> Line {
        Line{a: a.x - b.x, b: b.y - a.y, c: a.y * b.x - a.x * b.y}
    }
    fn is_parallel(&self, other: &Self) -> bool {
        self.a * other.b == self.b * other.a
    }
}
fn solve(used: usize, lines: &mut Vec<Line>, points: &Vec<Point>) -> usize {
    let mut first = points.len();
    for i in 0 .. points.len() {
        if used & (1 << i) == 0 {
            first = i;
            break
        }
    }
    if first == points.len() {
        0
    }else {
        let mut max = 0;
        for j in first + 1 .. points.len() {
            if used & (1 << j) == 0 {
                let line = Line::by_two_point(points[first], points[j]);
                let mut count = 0;
                for l in lines.iter() {
                    if line.is_parallel(l) {
                        count += 1;
                    }
                }
                lines.push(line);
                count += solve(used | (1 << first) | (1 << j), lines, points);
                lines.pop();
                if max < count {
                    max = count;
                }
            }
        }
        max
    }
}
fn main() {
    let_all!(m: usize);
    let mut points = Vec::with_capacity(m);
    for _ in 0 .. m {
        let_all!(x: i32, y: i32);
        points.push(Point{x: x, y: y});
    }
    let points = points;
    println!("{}", solve(0, &mut Vec::with_capacity(m / 2), &points));
}


Measured memory_bytes: 5028