Magical Binary Butterflies

You are given N binary strings, each representing a butterfly. A butterfly is defined as magical if the number of '1's is strictly greater than the number of '0's. Formally, for a given binary string s, it is magical if:

\( \#1(s) > \#0(s) \)

Your task is to count how many of the given butterflies are magical.

inputFormat

The input is read from stdin and has the following format:

• The first line contains an integer \( N \) representing the number of binary butterflies.
• Each of the next \( N \) lines contains a binary string, which is a sequence of characters '0' and '1'.

outputFormat

Print a single integer to stdout representing the number of magical butterflies.

3
110
10101
1000001

2