<imgclass="img-responsive center-block"alt="a completed example of a 3-gon ring"src="https://cdn-media-1.freecodecamp.org/project-euler/3-gon-ring.png"style="background-color: white; padding: 10px;"/>
Working **clockwise**, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.
By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513.
Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum **16-digit** string for a "magic" 5-gon ring?
<imgclass="img-responsive center-block"alt="a blank diagram of a 5-gon ring"src="https://cdn-media-1.freecodecamp.org/project-euler/5-gon-ring.png"style="background-color: white; padding: 10px;"/>