Not so easy
Source: Tournament of towns
December 2, 2019
combinatoricsKvant
Problem Statement
A polygon is given in which any two adjacent sides are perpendicular. We call its two vertices non-friendly if the bisectors of the polygon emerging from these vertices are perpendicular. Prove that for any vertex the number of vertices that are not friends with it is even.