An isosceles trapezium is called right if only one pair of its sides are parallel (i.e parallelograms are not right). A dissection of a rectangle into $n$ (can be different shapes) right isosceles trapeziums is called strict if the union of any $i,(2\leq i \leq n)$ trapeziums in the dissection do not form a right isosceles trapezium. Prove that for any $n, n\geq 9$ there is a strict dissection of a $2017 \times 2018$ rectangle into $n$ right isosceles trapeziums. Proposed by Bojan Basic