Problem Statement  
A positive integer is said to be squarefree if it is divisible by no perfect square larger than 1. For example, the first few squarefree numbers are {1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, ...}. Create a class SquareFree that contains a method getNumber, which is given an int n. The method should return the n^{th} smallest squarefree number. Note this is 1indexed, so if n = 1, the method should return the smallest squarefree number.  
Definition  
 
Constraints  
  n will be between 1 and 1,000,000,000 inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
