'''
A majority element is an element that makes up more than half of the items in an array. Given a positive integers array, find the majority element. If there is no majority element, return -1. Do this in O(N) time and O(1) space.

Example:
    Input: 1, 2, 5, 9, 5, 9, 5, 5, 5
    Output: 5

Hints: 522, 566, 604, 620, 650
'''


def majority_element(s):
    pass

if __name__ == '__main__':
    assert majority_element('') ==
    assert majority_element('') ==
    assert majority_element('') ==
    assert majority_element('') ==
    assert majority_element('') ==
