Question 5
The vertices of a regular nonagon ($9$-sided polygon) are to be labeled with the digits $1$ through $9$ in such a way that the sum of the numbers on every three consecutive vertices is a multiple of $3.$ Two acceptable arrangements are considered to be indistinguishable if one can be obtained from the other by rotating the nonagon in the plane. Find the number of distinguishable acceptable arrangements.