List elements can be accessed with the syntax name[index] where
index is zero-indexed.

A negative index accesses the list in reverse. It is the same as
reversing a list and then using a positive index. Similar to a positive
index, it is bounded by the length of the list as a negative value.

Lists may be compared
for equality. Lists are equal if they are of equal length and their
corresponding elements are comparable and equal. Lists with the same elements
but in a different order are not equal.

List comparison speed is O(N), meaning that the speed of the comparison is
linearly proportional to the number of elements in the list. The more
elements, the more iterations that are necessary to verify equality.

The N-value quoted above should account for the sum of the elements of all
lists in the subjects of comparison, as list comparison will recurse into these
lists to check for equality.