I understand the math but need help with the code:

Write a python code to simulate the following game and compute the vale of E[N]: Thirteen cards (1,2,13) are shuffled and dealt one at a time. say a match occurs on deal k if the k-th card revealed is card number k (you could say the event A has occurred). Let N be the total number of matches that occur in the thirteen cards.