A square is given. Lines divide it into $n$ polygons. What is he the largest possible sum of the internal angles of all polygons?
Problem
Source: Czech-Polish-Slovak Junior Match 2014, Individual p5 CPSJ
Tags: Sum, angles, Polygons, Sqaure, combinatorial geometry, combinatorics