import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.BufferedWriter;
import java.io.Writer;
import java.io.OutputStreamWriter;
import java.util.InputMismatchException;
import java.io.IOException;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author prakharjain
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        OutputWriter out = new OutputWriter(outputStream);
        BPickingUp solver = new BPickingUp();
        solver.solve(1, in, out);
        out.close();
    }

    static class BPickingUp {
        public void solve(int testNumber, InputReader in, OutputWriter out) {
            int n = in.nextInt();

            long[][] c = new long[n][2];

            for (int i = 0; i < n; i++) {
                c[i][0] = in.nextInt();
                c[i][1] = in.nextInt();
            }

            int ans = n;

            for (int i = 0; i < n; i++) {
                for (int j = i + 1; j < n; j++) {
                    long p = c[j][0] - c[i][0];
                    long q = c[j][1] - c[i][1];

                    if (p == 0 && q == 0) {
                        continue;
                    }

                    ans = Math.min(ans, calMin(p, q, c));
                }
            }

            out.println(ans);
        }

        int calMin(long p, long q, long[][] c) {
            int n = c.length;

            boolean[] v = new boolean[n];

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

                if (!v[i]) {

                    boolean f = false;
                    for (int j = 0; j < n; j++) {
                        if (c[j][0] + p == c[i][0] && c[j][1] + q == c[i][1]) {
                            f = true;
                            break;
                        }
                    }

                    if (!f) {
                        int ci = i;
                        while (true) {
                            v[ci] = true;
                            f = false;
                            for (int j = 0; j < n; j++) {
                                if (!v[j] && c[j][0] == c[i][0] + p && c[j][1] == c[i][1] + q) {
                                    f = true;
                                    ci = j;
                                    break;
                                }
                            }

                            if (!f) {
                                ans++;
                                break;
                            }
                        }
                    }
                }
            }

            return ans;
        }

    }

    static class OutputWriter {
        private final PrintWriter writer;

        public OutputWriter(OutputStream outputStream) {
            writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
        }

        public OutputWriter(Writer writer) {
            this.writer = new PrintWriter(writer);
        }

        public void close() {
            writer.close();
        }

        public void println(int i) {
            writer.println(i);
        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;
        private InputReader.SpaceCharFilter filter;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public static boolean isWhitespace(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

        public int read() {
            if (numChars == -1) {
                throw new InputMismatchException();
            }
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new InputMismatchException();
                }
                if (numChars <= 0) {
                    return -1;
                }
            }
            return buf[curChar++];
        }

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public boolean isSpaceChar(int c) {
            if (filter != null) {
                return filter.isSpaceChar(c);
            }
            return isWhitespace(c);
        }

        public interface SpaceCharFilter {
            public boolean isSpaceChar(int ch);

        }

    }
}



Measured memory_bytes: 23124