Each vertex of a regular octagon is coloured either red or blue with equal probability. This market resolves yes if the octagon can then be rotated in such a way that all of the blue vertices end up at points that were originally red.

Formally, I will use @FairlyRandom to generate a random integer from 1 to 1,000,000 inclusive as a seed SEED. Then I will run the following python program with said seed inserted.

```

import random

random.seed(SEED) # Inserted here

s = [random.choice([0,1]) for _ in range(8)]

print(s)

rotation = False

for i in range(8):

b = True

for j in range(8):

if (s[j%8] == 1 and s[(i+j)%8] == 1):

b = False

break

if (b):

rotation = True

break

if rotation:

print("Rotation Exists")

else:

print("Rotation Does Not Exist")

```