In a convex n-gon (n>4) no three diagonals are concurrent (intersect at the same point). What is the maximum number of the diagonals that can be drawn into this polygon so that all the parts they divide into are triangles?