Create a function that counts the number of blocks of two or more adjacent 1s in an array.
countOnes([1, 0, 0, 1, 1, 0, 1, 1, 1]) ➞ 2
// Two instances: [1, 1] (middle) and [1, 1, 1] (end)
countOnes([1, 0, 1, 0, 1, 0, 1, 0]) ➞ 0
countOnes([1, 1, 1, 1, 0, 0, 0, 0]) ➞ 1
countOnes([0, 0, 0]) ➞ 0