Employees take exams , Judgment questions X10（ Every 2 branch ）, Single topic selection X10（ Every 4 branch ）, Multiple choice X5（ Eight points for each ）.
You can only answer in sequence , Correct score , Wrong answer, no score . Three wrong answers , Suspend the exam .

Enter the test result score ,
Output the number of possible answers .

1 to flash back （ Show the right questions 、 Number of questions ）

How to deal with wrong answers ？

When backtracking recursively traverses a binary tree , After traversing the leaf node , Need to trace back to the parent node , Traverse the next node of the parent node , It can be understood as , The leaf node just traversed is Wrong answer The situation of , Therefore, we do not count the topics represented by the leaf node to Answer A collection of topics （path） in .

One answer , It is equivalent to traversing the branches of a binary tree once .

namely , Go back once , The representative answered a wrong question .

package com.huawei;

import java.util