#include <bits/stdc++.h>
using namespace std;

#pragma warning(disable : 4267) // "int n = (unsigned)size"

using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using ll = long long int;
using vll = vector<ll>; using vvll = vector<vll>; using vvvll = vector<vvll>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
using cdouble = complex<double>;

const double eps = 1e-9;
const double INFD = numeric_limits<double>::infinity();
#define Loop(i, n) for(int i = 0; i < int(n); i++)
#define Loopll(i, n) for(ll i = 0; i < ll(n); i++)
#define Loop1(i, n) for(int i = 1; i <= int(n); i++)
#define Loopll1(i, n) for(ll i = 1; i <= ll(n); i++)
#define Loopr(i, n) for(int i = int(n) - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = ll(n) - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = int(n); i >= 1; i--)
#define Looprll1(i, n) for(ll i = ll(n); i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= (h) ? (h) - 1 : (sum)), j = (sum) - i; i >= 0 && j < (w); i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= (w) ? (w) - 1 : (sum)), i = (sum) - j; j >= 0 && i < (h); j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(ex_i, vector.size()) { cout << vector[ex_i] << " "; } cout << endl;
#define printmx(matrix) Loop(ex_i, matrix.size()) { Loop(ex_j, matrix[ex_i].size()) { cout << matrix[ex_i][ex_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
#define Comp(type_t) bool operator<(const type_t &another) const
#define fst first
#define snd second
bool nearlyeq(double x, double y) { return abs(x - y) < eps; }
bool inrange(ll x, ll t) { return x >= 0 && x < t; }
bool inrange(vll xs, ll t) { Foreach(x, xs) if (!(x >= 0 && x < t)) return false; return true; }
int ceillog2(ll x) { int ret = 0;	x--; while (x > 0) { ret++; x >>= 1; } return ret; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (m * m <= x ? 0 : -1); }
ll ceilsqrt(ll x) { ll m = (ll)sqrt((double)x); return m + (x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }
ll lcm(ll m, ll n) { return m * n / gcd(m, n); }

/*******************************************************/

struct intpt_t {
	ll x, y;
	intpt_t operator+(const intpt_t &p) { return { x + p.x, y + p.y }; }
	intpt_t operator-(const intpt_t &p) { return { x - p.x, y - p.y }; }
	intpt_t operator*(const ll &c) { return { x * c, y * c }; }
	intpt_t operator/(const ll &c) { return { x / c, y / c }; }
	bool operator==(const intpt_t &p) { return x == p.x && y == p.y; }
};

struct pt_t {
	double x, y;
	pt_t operator+(const pt_t &p) { return { x + p.x, y + p.y }; }
	pt_t operator-(const pt_t &p) { return { x - p.x, y - p.y }; }
	pt_t operator*(const double &c) { return { x * c, y * c }; }
};

pt_t cvtpt(intpt_t p) {
	return { double(p.x), double(p.y) };
}

// ax + by + c = 0
struct line_t {
	double a, b, c;
};

pt_t cross_point(line_t l, line_t m) {
	pt_t ret = { INFD, INFD };
	double d = l.a * m.b - m.a * l.b;
	if (nearlyeq(d, 0)) return ret;
	double x = l.b * m.c - m.b * l.c;
	double y = l.a * m.c - m.a * l.c;
	ret = { x / d, y / -d };
	return ret;
}

// normal vector = (a, b), passing p
line_t solve_line(double a, double b, pt_t p) {
	return { a, b, -a * p.x - b * p.y };
}

// t should be radius
pt_t rot(pt_t p, double r) {
	return {
		cos(r) * p.x - sin(r) * p.y,
		sin(r) * p.x + cos(r) * p.y
	};
}

double abs(pt_t p) {
	return sqrt(p.x * p.x + p.y * p.y);
}

// angle [0, 2PI) of vector p to vector q
double angle(pt_t p, pt_t q) {
	p = p * (1.0 / abs(p));
	q = q * (1.0 / abs(q));
	double r0 = acos(max(min(p.x * q.x + p.y * q.y, 1.0), -1.0));
	double r1 = asin(max(min(p.x * q.y - p.y * q.x, 1.0), -1.0));
	if (r1 >= 0) return r0;
	else return 2 * M_PI - r0;
}

double dist(line_t l, pt_t p) {
	return abs(l.a * p.x + l.b * p.y + l.c)
		/ sqrt(l.a * l.a + l.b * l.b);
}

bool on_same_line(intpt_t p, intpt_t q) {
	int mask = (p.x ? 0 : 0b1000) + (p.y ? 0 : 0b100)
		+ (q.x ? 0 : 0b10) + (q.y ? 0 : 0b1);
	if ((mask & 0b1100) == 0b1100 || (mask & 0b0011) == 0b0011) return true;
	if ((mask & 0b1010) == 0b1010 || (mask & 0b0101) == 0b0101) return true;
	if (mask == 0b0000) {
		p = p / gcd(p.x, p.y);
		q = q / gcd(q.x, q.y);
		if (p.x < 0) p = p * -1;
		if (q.x < 0) q = q * -1;
		if (p == q) return true;
		else return false;
	}
	else return false;
}

bool on_same_line(pt_t p, pt_t q) {
	line_t l = solve_line(p.y, -p.x, p);
	if (dist(l, q) < eps) return true;
	else return false;
}

int main() {
	intpt_t p0, p1;
	cin >> p0.x >> p0.y >> p1.x >> p1.y;
	int q; cin >> q;
	cout << setprecision(20);
	Loop(i, q) {
		intpt_t p2;
		cin >> p2.x >> p2.y;
		intpt_t ip = p1 - p0;
		intpt_t iq = p2 - p0;
		pt_t p = cvtpt(ip);
		pt_t q = cvtpt(iq);
		bool judge;
		if (on_same_line(p, q)) judge = true;
		else judge = false;
		double r = angle(p, q);
		if (judge) {
			if (M_PI * 0.5 < r && r < M_PI * 1.5) {
				cout << "ONLINE_BACK" << endl;
			}
			else {
				if (abs(q) > abs(p)) {
					cout << "ONLINE_FRONT" << endl;
				}
				else {
					cout << "ON_SEGMENT" << endl;
				}
			}
		}
		else {
			if (r < M_PI) {
				cout << "COUNTER_CLOCKWISE" << endl;
			}
			else {
				cout << "CLOCKWISE" << endl;
			}
		}
	}
}


Measured memory_bytes: 3476