Problem O
WFF 'N PROOF
WFF ’N PROOF is a logic game played with dice. Each die has six faces representing some subset of the possible symbols $K, A, N, C, E, p, q, r, s, t$. A Well-formed formula (WFF) is any string of these symbols obeying the following rules:
-
$p, q, r, s,$ and $t$ are WFFs
-
if $w$ is a WFF, $Nw$ is a WFF
-
if $w$ and $x$ are WFFs, $Kwx$, $Awx$, $Cwx$, and $Ewx$ are WFFs.
The meaning of a WFF is defined as follows:
-
$p, q, r, s,$ and $t$ are logical variables that may take on the value 0 (false) or 1 (true).
-
$K, A, N, C, E$ mean and, or, not, implies, and equals as defined in the truth table below.
|
$w$ |
$x$ |
$Kwx$ |
$Awx$ |
$Nw$ |
$Cwx$ |
$Ewx$ |
|
1 |
1 |
1 |
1 |
0 |
1 |
1 |
|
1 |
0 |
0 |
1 |
0 |
0 |
0 |
|
0 |
1 |
0 |
1 |
1 |
1 |
0 |
|
0 |
0 |
0 |
0 |
1 |
1 |
1 |
Given a collection of symbols resulting from throwing a set of dice, determine the longest WFF that can be formed from those symbols.
Input
Input consists of several test cases. Each test case is a single line containing a string containing between 1 and 100 of the characters. A line containing 0 follows the last case.
Output
For each test case, output a line containing the longest WFF that can be formed using some subset of the letters in the string. If there are several such WFFs, any one will do. If no WFF can be constructed, output a line containing “no WFF possible” as shown below.
| Sample Input 1 | Sample Output 1 |
|---|---|
qKpNq KKN 0 |
KqNq no WFF possible |
