<image>

For given three points p0, p1, p2, print


COUNTER_CLOCKWISE


if p0, p1, p2 make a counterclockwise turn (1),


CLOCKWISE


if p0, p1, p2 make a clockwise turn (2),


ONLINE_BACK


if p2 is on a line p2, p0, p1 in this order (3),


ONLINE_FRONT


if p2 is on a line p0, p1, p2 in this order (4),


ON_SEGMENT


if p2 is on a segment p0p1 (5).

Constraints

* 1 ≤ q ≤ 1000
* -10000 ≤ xi, yi ≤ 10000
* p0 and p1 are not identical.

Input


xp0 yp0 xp1 yp1
q
xp20 yp20
xp21 yp21
...
xp2q-1 yp2q-1


In the first line, integer coordinates of p0 and p1 are given. Then, q queries are given for integer coordinates of p2.

Output

For each query, print the above mentioned status.

Examples

Input

0 0 2 0
2
-1 1
-1 -1


Output

COUNTER_CLOCKWISE
CLOCKWISE


Input

0 0 2 0
3
-1 0
0 0
3 0


Output

ONLINE_BACK
ON_SEGMENT
ONLINE_FRONT
// CGL_1_C.cpp
//
#include <bits/stdc++.h>
using namespace std;


const double EPS = 1e-10;

typedef complex<double> Point;
#define X real()
#define Y imag()

struct Segment {
  Point p1, p2;
  Segment(){};
  Segment(Point p1, Point p2) : p1(p1), p2(p2) {};
};
typedef Segment Line;

double dot(Point a, Point b){return real(conj(a) * b);}
double cross(Point a, Point b){return imag(conj(a) * b);}

string ccw(Point a, Point b, Point c) {
  Point x = b - a;
  Point y = c - a;
  if(cross(x, y) > EPS) return "COUNTER_CLOCKWISE";
  if(cross(x, y) < -EPS) return "CLOCKWISE";
  if(dot(x, y) < -EPS) return "ONLINE_BACK";
  if(norm(x) < norm(y)) return "ONLINE_FRONT";
  return "ON_SEGMENT";
}


int main() {
  int a,b,c,d,q;
  cin>>a>>b>>c>>d>>q;
  Point p0(a,b), p1(c,d);
  for(int i=0;i<q;++i){
    int e,f;
    cin>>e>>f;
    Point p2(e,f);
    cout<<ccw(p0,p1,p2)<<endl;
  }
  return 0;
}

