<SYSTEM_TASK:>
Given the following text description, write Python code to implement the functionality described below step by step
<END_TASK>
<USER_TASK:>
Description:
 This notebook explores how fast determining if some value
is in lists, tuples, sets, and dictionaries.
See simplified conclusion at bottom of notebook.
The Mighty Dictionary (#55)
All Your Ducks In A Row
Step1:  Determining if something is in the tuple
takes about the same time as determining if something is in the list.
Step2:  Determining if something is in the set was about 2.5 million times faster
than determining if something is in the list.
<ASSISTANT_TASK:>
Python Code:
n = 10**7
a = list(range(n))
b = tuple(a)
c = set(a)
d = dict(zip(a, a))
5 in a, 5 in b, 5 in c, 5 in d
i = n/2
%timeit i in a
%timeit i in b
Explanation: This notebook explores how fast determining if some value
is in lists, tuples, sets, and dictionaries.
See simplified conclusion at bottom of notebook.
The Mighty Dictionary (#55)
All Your Ducks In A Row: Data Structures in the Standard Library and Beyond
End of explanation
%timeit i in c
730e-3 / 289e-9
Explanation: Determining if something is in the tuple
takes about the same time as determining if something is in the list.
End of explanation
%timeit i in d
730e-3 / 295e-9
Explanation: Determining if something is in the set was about 2.5 million times faster
than determining if something is in the list.
End of explanation
<END_TASK>