(B.Frenkin) An inscribed and circumscribed $ n$-gon is divided by some line into two inscribed and circumscribed polygons with different numbers of sides. Find $ n$.