PROBLEM LINKS :
Author : saif_husain
Given the number of sticks N, obtain the largest possible LED number from it.
The problem doesn’t required any special algorithm.
More the number of digits larger the number obtained.
With minimum 2 sticks we get a new digit i.e. 1
As 2<=N<=100, the only thing we need to check is whether N is even or odd.
if N is even the resultant number will contain only 1s. If it is odd we can use 7 at leftmost place as it requires only 3 sticks followed by (n-3) 1s.