Find all positive integers $n$ for which it is possible to partition a regular $n$-gon into triangles with diagonals not intersecting inside the $n$-gon such that at every vertex of the $n$-gon an odd number of triangles meet.
Problem
Source: Estonia IMO TST 2015 p8
Tags: combinatorial geometry, combinatorics, regular polygon, diagonals