We have $n$ lines of three integers, where the $i$-th number will be a $1$ if the $i$-th player can solve the problem, $0$ otherwise. We need to determine the number of problems that the team thinks they can solve. The team can solve the problem is at least $2$ out of the $3$ can solve it. Bounds are $1 \leq n \leq 1000$, so just read, loop, and count.