human
Can you provide a the Python program you requested given the following:
I found an interesting problem on https://leetcode.com/problems/1-bit-and-2-bit-characters/:
We have two special characters. The first character can be represented by one bit 0. The second character can be represented by two bits (10 or 11).  

Now given a string represented by several bits. Return whether the last character must be a one-bit character or not. The given string will always end with a zero.

Example 1:

Input: 
bits = [1, 0, 0]
Output: True
Explanation: 
The only way to decode it is two-bit character and one-bit character. So the last character is one-bit character.


Example 2:

Input: 
bits = [1, 1, 1, 0]
Output: False
Explanation: 
The only way to decode it is two-bit character and two-bit character. So the last character is NOT one-bit character.


Note:
1 .
bits[i] is always 0 or 1.

I tried it in Python, but could not do it. Can you solve it?
assistant
#Here is the Python program you requested.

class Solution:
     def isOneBitCharacter(self, bits):
         """
         :type bits: List[int]
         :rtype: bool
         """
         n = 0
         for i in range(-2, -len(bits)-1, -1):
             if bits[i] == 1:
                 n += 1
             else:
                 break
         return n % 2 == 0