readln(m, n, k); 
for i := 1 to m do 
begin
  for j := 1 to n do read(c[i, j]); 
  readln; 
end;

 
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
 
namespace _12246.Dãy_số_1
{
    class Program
    {
        static int[] p;
        static void Main(string[] args)
        {
            int n = Convert.ToInt32(Console.ReadLine());
            p = new int[n];
            for (int i = 0; i < n; i++)
            {
                char c = (char)Console.Read();
                while (c == ' ' || c == '\n')
                {
                    c = (char)Console.Read();
                }
                string s = "";
                while (c != ' ' && c != '\n')
                {
 
                    s += c;
                    c = (char)Console.Read();
 
                }
                p[i] = Convert.ToInt32(s.ToString());
            }
            while (n > 2)
            {
                int k = n / 2;
                for (int i = 0; i < k; i++)
                {
                    bool je = jeVhodny(i, k);
                    if (je)
                    {
                        Console.WriteLine(k);
                        goto exit;
                    }
                }
                n -= 2;
            }
            Console.WriteLine(0);
        exit: ;
        }
        static bool jeVhodny(int i, int k)
        {
            for (int j = i; j < k; j++)
            {
                if (p[j] >= p[j + k]) return false;
            }
            return true;
        }
    }
}

type toado = record
           x,y:integer;
           antoan:byte;
           end;
var f:text;
    i,k,n,j,min,cs:byte;
    a:array[1..255] of toado;
begin
assign(f,'');
reset(f);
readln(f);
n:=0;
while not eof(f) do
        begin
                inc(n);
                read(f,a[n].x);
                readln(f,a[n].y);
                a[n].antoan:=0;
        end;
        close(f);
cs:=0;
for i:=1 to n do
for j:=i to n do
for k:=j to n do
begin
 
     if (a[k].x - a[j].x)*(a[k].y - a[i].y)<> (a[k].y - a[j].y)*(a[k].x - a[i].x)
     then begin
                inc(cs);
                inc(a[k].antoan);
                inc(a[j].antoan);
                inc(a[i].antoan);
          end;
 
end;
min:=a[1].antoan;
j:=1;
for i:=2 to n do
        if min > a[i].antoan then
        begin
             min:=a[i].antoan;
             j:=i;
        end;
assign(f,'');
write(f);
write(f,cs,' ');
write(f,j,' ');
close(f);
end.