import
java.util.*;
class
GFG
{
static
int
dx[] = { -
1
,
0
,
1
,
0
};
static
int
dy[] = {
0
,
1
,
0
, -
1
};
static
boolean
ifRight(
int
x1,
int
y1,
int
x2,
int
y2,
int
x3,
int
y3)
{
int
a = ((x1 - x2) * (x1 - x2)) +
((y1 - y2) * (y1 - y2));
int
b = ((x1 - x3) * (x1 - x3)) +
((y1 - y3) * (y1 - y3));
int
c = ((x2 - x3) * (x2 - x3)) +
((y2 - y3) * (y2 - y3));
if
((a == (b + c) && a !=
0
&& b !=
0
&& c !=
0
) ||
(b == (a + c) && a !=
0
&& b !=
0
&& c !=
0
) ||
(c == (a + b) && a !=
0
&& b !=
0
&& c !=
0
))
{
return
true
;
}
return
false
;
}
static
void
isValidCombination(
int
x1,
int
y1,
int
x2,
int
y2,
int
x3,
int
y3)
{
int
x, y;
boolean
possible =
false
;
if
(ifRight(x1, y1, x2, y2, x3, y3))
{
System.out.print(
"ALREADY RIGHT ANGLED"
);
return
;
}
else
{
for
(
int
i =
0
; i <
4
; i++)
{
x = dx[i] + x1;
y = dy[i] + y1;
if
(ifRight(x, y, x2, y2, x3, y3))
{
System.out.print(
"POSSIBLE"
);
return
;
}
x = dx[i] + x2;
y = dy[i] + y2;
if
(ifRight(x1, y1, x, y, x3, y3))
{
System.out.print(
"POSSIBLE"
);
return
;
}
x = dx[i] + x3;
y = dy[i] + y3;
if
(ifRight(x1, y1, x2, y2, x, y))
{
System.out.print(
"POSSIBLE"
);
return
;
}
}
}
if
(!possible)
System.out.println(
"NOT POSSIBLE"
);
}
public
static
void
main(String[] args)
{
int
x1 = -
49
, y1 =
0
;
int
x2 =
0
, y2 =
50
;
int
x3 =
0
, y3 = -
50
;
isValidCombination(x1, y1, x2, y2, x3, y3);
}
}