<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
#include <iostream>
#include <string>
#include <cmath>
using namespace std;

int x_0, y_0, x_1, y_1;
int q;
int x, y;

int choice();
int gaiseki(int, int, int, int);
int naiseki(int, int, int, int);
double norm(int, int);
int main(){
  cin >> x_0 >> y_0 >> x_1 >> y_1;

  cin >> q;
  string s[] = {"COUNTER_CLOCKWISE", "CLOCKWISE", "ONLINE_BACK", "ON_SEGMENT", "ONLINE_FRONT"};

  for(int i=0; i<q; i++){
    cin >> x >> y;
    cout << s[choice()] << endl;
  }

  return 0;
}

int choice(){
  if(gaiseki(x_1-x_0, y_1-y_0, x-x_0, y-y_0)>0) return 0;
  else if(gaiseki(x_1-x_0, y_1-y_0, x-x_0, y-y_0)<0) return 1;
  else{
    if(naiseki(x_1-x_0, y_1-y_0, x-x_0, y-y_0)<0){
      return 2;
    }else{
      if(norm(x-x_0, y-y_0)<=norm(x_1-x_0, y_1-y_0)) return 3;
      else return 4;
    }
  }
}

int gaiseki(int ax, int ay, int bx, int by){
  return ax*by - ay*bx;
}

int naiseki(int ax, int ay, int bx, int by){
  return ax*bx + ay*by;
}

double norm(int ax, int ay){
  return sqrt(ax*ax+ay*ay);
}

