------
## 最终结论
```python
def min_skip_points(t, test_cases):
    results = []
    for n, a in test_cases:
        skip_points = 0
        i = 0
        while i < n:
            if i % 2 == 0:  # Friend's turn
                if a[i] == 1:
                    skip_points += 1
                if i + 1 < n and a[i + 1] == 1:
                    skip_points += 1
                    i += 2
                else:
                    i += 1
            else:  # Your turn
                if i + 1 < n:
                    i += 2
                else:
                    i += 1
        results.append(skip_points)
    return results

# Example usage:
t = 6
test_cases = [
    (8, [1, 0, 1, 1, 0, 1, 1, 1]),
    (5, [1, 1, 1, 1, 0]),
    (7, [1, 1, 1, 1, 0, 0, 1]),
    (6, [1, 1, 1, 1, 1, 1]),
    (1, [1]),
    (1, [0])
]

print(min_skip_points(t, test_cases))
```