A circle is drawn with center at and points through are equally spaced around the circle.
Line segments are drawn to connect to each of these points.
Compute the number of ways to delete of the line segments or arcs such that the points are still connected.
In test data worth 10% of marks, you may assume .
The first and only line contains a single positive integer, .
Output the number of desired configurations.