Simple Problem 010

Given an array of integers a1,a2,a3,....aN of length N.These integers are PIN code of N cities of ChefLand.There is a two way connecting path between each pairs of city $ ai $ and $ aj $ ($1 \leq i \leq N$ ,$1 \leq j \leq N$) if and only if the PIN codes of these pairs of cities are Coprime( $ ai $ and $ aj $ are $ Coprime $),and length of path would be sum of PIN code($ ai $ + $ aj $). Chef