'''
You are given an array with all the numbers frm 1 to N appearing exactly once, except for one number that is missing. How can you find the missing number in O(N) time and O(1) space? What if there were two numbers missing?

Hints: 503, 590, 609, 626, 649, 672, 689, 696, 702, 717
'''


def missing_two(s):
    pass

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