It's my program:

{$N+}
Program p1111;

Type
  TPoint=Record
           x,y:Double;
         End;

Var
  Point:Array[1..100,1..2] Of TPoint;
  Len:Array[1..100] Of Double;
  num:Array[1..100] Of Integer;
  n:Integer;
  po:TPoint;

  Procedure Other(p1,p2:TPoint;Var p3,p4:TPoint);
  Var m,n:Double;
      po:TPoint;
  Begin
    po.x:=(p1.x+p2.x)/2;
    po.y:=(p1.y+p2.y)/2;
    n:=p1.x-po.x;m:=p1.y-po.y;
    p3.x:=m;p3.y:=-n;
    p4.x:=-p3.x;p4.y:=n;
    p3.x:=p3.x+po.x;p3.y:=p3.y+po.y;
    p4.x:=p4.x+po.x;p4.y:=p4.y+po.y;
  End;

  Procedure Init;
  Var
    i:Integer;
  Begin
    {$IFNDEF ONLINE_JUDGE}
    Assign(Input,'1111.Txt');
    Reset(Input);
    {$ENDIF}
    Readln(n);
    For i:=1 To n Do
      Readln(Point[i,1].x,Point[i,1].y,
             Point[i,2].x,Point[i,2].y);
    Readln(po.x,po.y);
  End;

  Procedure Main;
  Var
    i,j,k:Integer;
    p:Array[1..5] Of TPoint;
    u,A,B,C,L1,L2,L3,q1,q2,S:Double;
  Begin
    For i:=1 To n Do
    Begin
      num[i]:=i;
      p[1]:=Point[i,1];
      p[3]:=Point[i,2];
      Other(p[1],p[3],p[2],p[4]);
      p[5]:=p[1];
      L1:=sqr(p[1].x-p[2].x)+sqr(p[1].y-p[2].y);
      If Abs(L1)<1e-14
      Then Begin
             Len[i]:=sqr(po.x-p[1].x)+sqr(po.y-p[1].y);
             Continue;
           End;
      S:=0;
      For j:=1 To 4 Do
      Begin
        q1:=sqrt(sqr(po.x-p[j].x)+sqr(po.y-p[j].y));
        q2:=sqrt(sqr(po.x-p[j+1].x)+sqr(po.y-p[j+1].y));
        u:=(q1+q2+sqrt(L1))/2;
        S:=S+sqrt(u*(u-q1)*(u-q2)*(u-sqrt(L1)));
      End;
      If Abs(S-L1)<1e-14
      Then Begin
             Len[i]:=0;
             Continue;
           End;
      S:=1e300;
      For j:=1 To 4 Do
      Begin
        A:=p[j+1].y-p[j].y;
        B:=p[j].x-p[j+1].x;
        C:=-A*p[j].x-B*p[j].y;
        L2:=sqr(p[j].x-po.x)+sqr(p[j].y-po.y);
        L3:=sqr(p[j+1].x-po.x)+sqr(p[j+1].y-po.y);
        If not((L1+L3-L2<0)or(L1+L2-L3<0))
        Then Begin
               u:=Sqr(A*po.x+B*po.y+C)/(A*A+B*B);
               If u<S
               Then S:=u;
             End;
      End;
      For j:=1 To 4 Do
      Begin
        u:=Sqr(po.x-p[j].x)+Sqr(po.y-p[j].y);
        If u<S
        Then S:=u;
      End;
      Len[i]:=S;
    End;
    For i:=1 To n-1 Do
      For j:=i+1 To n Do
      If Len[i]>Len[j]
      Then Begin
             S:=Len[i];
             Len[i]:=Len[j];
             Len[j]:=s;
             k:=num[i];
             num[i]:=num[j];
             num[j]:=k;
           End;
    For i:=1 To n-1 Do
      Write(num[i],' ');
    Writeln(num[n]);
  End;

Begin
  Init;
  Main;
End.