<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
import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int xp0 = sc.nextInt();
		int yp0 = sc.nextInt();
		int xp1 = sc.nextInt();
		int yp1 = sc.nextInt();

		int q = sc.nextInt();
		for (int i = 0; i < q; i++) {
			int xp2 = sc.nextInt();
			int yp2 = sc.nextInt();

			int ax = xp1 - xp0;
			int ay = yp1 - yp0;
			int bx = xp2 - xp0;
			int by = yp2 - yp0;
			int dot = Geom.dot(ax, ay, bx, by);
			int cross = Geom.cross(ax, ay, bx, by);
			int a2 = Geom.sumofsquare(ax, ay);

			if (cross > 0) {
				System.out.println("COUNTER_CLOCKWISE");
			} else if (cross < 0) {
				System.out.println("CLOCKWISE");
			} else {
				if (dot < 0) {
					System.out.println("ONLINE_BACK");
				} else if (dot > a2) {
					System.out.println("ONLINE_FRONT");
				} else {
					System.out.println("ON_SEGMENT");
				}
			}
		}

		sc.close();
	}
	
	private static class Geom {
		static int dot(int xa, int ya, int xb, int yb) {
			return xa * xb + ya * yb;
		}

		static int cross(int xa, int ya, int xb, int yb) {
			return xa * yb - xb * ya;
		}
		
		static int sumofsquare(int xa, int ya) {
			return xa * xa + ya * ya;
		}
	}
}