<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 <cmath>
#include <iostream>

using namespace std;

#define EPS 1e-10
#define equals(a, b) (fabs((a) - (b)) < EPS)

class Point {
public:
  double x, y;
  Point() {};
  Point(double x, double y): x(x), y(y) {}

  Point operator + (const Point &p) { return Point(x + p.x, y + p.y); }
  Point operator - (const Point &p) { return Point(x - p.x, y - p.y); }
  Point operator * (double d) { return Point(d * x, d * y); }
  Point operator / (double d) { return Point(d / x, d / y); }

  bool operator < (const Point &p) const {
    return (x == p.x ? y < p.y : x < p.x);
  }

  bool operator == (const Point &p) const {
    return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
  }

  friend ostream& operator << (ostream &os, Point &p) {
    return os << "Point(" << p.x << ", " << p.y << ")";
  }
};

struct Segment {
  Point p0, p1;
};

double cross (Point p1, Point p2) {
  return p1.x * p2.y - p1.y * p2.x;
}

double dot(Point p1, Point p2) {
  return p1.x * p2.x + p1.y * p2.y;
}

double norm(Point p) {
  return p.x * p.x + p.y * p.y;
}

string ccw(Segment s, Point p2) {
  if (cross(s.p1 - s.p0, p2 - s.p0) > 0) return "COUNTER_CLOCKWISE";
  if (cross(s.p1 - s.p0, p2- s.p0) < 0) return "CLOCKWISE";
  if (dot(s.p1 - s.p0, p2 - s.p0) < 0) return "ONLINE_BACK";
  if (norm(s.p1 - s.p0) < norm(p2 - s.p0)) return "ONLINE_FRONT";
  return "ON_SEGMENT";
}

int main() {
  int x1, y1, x2, y2;
  cin >> x1 >> y1 >> x2 >> y2;

  Segment s;
  s.p0 = Point(x1, y1);
  s.p1 = Point(x2, y2);

  int n; cin >> n;

  while (n--) {
    int x, y; cin >> x >> y;
    Point p2(x, y);

    cout << ccw(s, p2) << endl;
  }
}