Find the number of quadruplets with GCD equal to 1 : <p>Given a sequence of numbers from 1 to N, we have to find the number of quadruplets such that their Greatest Common Divisor (GCD) is 1.</p>

<p><em>Constraints</em> : N &lt;= 10^5</p>

<p><em>Example</em> : N=5. So the number of such quadruplets from {1,2,3,4,5} are :</p>

<ul>
<li>{1,2,3,4}</li>
<li>{1,2,3,5}</li>
<li>{1,2,4,5}</li>
<li>{1,3,4,5}</li>
<li>{2,3,4,5}</li>
</ul>

<p>So the answer in this case is 5.</p>
