<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<bits/stdc++.h>
#define ll  long long
#define int long long
#define inf 0x3f3f3f3f
#define fi first
#define se second
#define pb push_back
#define pa pair<int,int>
#define mkp(a,b) make_pair(a,b)
const int N=2e5+10;
const int mod=998244353;
using namespace std;

int cross(int x1,int y1,int x2,int y2){return x1*y2-x2*y1;}
int dot(int x1,int y1,int x2,int y2){return x1*x2+y1*y2;}
int32_t main()
{
   //ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
   int32_t x1,y1,x2,y2; scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
   int32_t q; scanf("%d",&q);
   while(q--)
   {
   	  int32_t x,y; scanf("%d%d",&x,&y);
   	  int p=cross(x-x1,y-y1,x2-x1,y2-y1);
   	  if(p<0) puts("COUNTER_CLOCKWISE");
   	  else if(p>0) puts("CLOCKWISE");
   	  else
   	  {
   	  	 if(dot(x1-x,y1-y,x2-x,y2-y)<=0) puts("ON_SEGMENT");  
   	  	 else if(dot(x-x1,y-y1,x2-x1,y2-y1)<=0) puts("ONLINE_BACK");
   	  	 else  puts("ONLINE_FRONT");
   	  }
   }
return 0;
}
/*
 
*/
