A chord (straight line joining two points) is drawn between every two points upon the perimeter of circle. There are n points on the perimeter. Every two chords intersect at the point either on the perimeter or inside the circle. (An intersection point is the point at which 2 or more chords meet.) Determine the max number of chords which can go through any single intersection points inside the circle?