ニ、(Full score 25 points) Write 1995 equations of the form $A_{i} x^{2}+B_{i} x+C_{i}=0(i=1,2, \cdots, 1995)$ on the blackboard. Two people, A and B, take turns to play a game. Each time, only one non-zero real number is allowed to replace one of the $A_{i}, B$ or $C$ in the $n$ equations $(i=1,2, \cdots, 1995)$. Once a coefficient in the equation is filled, it cannot be changed. After $3 \times 1995$ steps, 1995 quadratic equations with specific real coefficients are obtained. A always tries to make as many quadratic equations as possible have no roots, while B always tries to prevent A from achieving his goal. If A fills first, how many rootless equations can A get at most, regardless of what B does?