Demonstrate solution to death row problem

death_row.py

import operator
import random
import sys

# https://en.wikipedia.org/wiki/Prisoners_and_hats_puzzle#Countably_Infinite_Hat_Problem_with_Hearing

def answer(death_row, answers):
    return reduce(operator.xor, death_row + answers)

def main(death_row):
    answers = []
    while death_row:
        answers.append(answer(death_row[1:], answers))
        death_row.pop(0)
    return answers

if __name__ == '__main__':
    count = int(sys.argv[1])
    random.seed()
    death_row = [random.choice([0,1]) for i in xrange(count)]
    print death_row
    print main(death_row)