Problem Statement  
Let N_{1} = {1, 2, 3, 4, 5, ..., 1000} (the set of all positive integers between 1 and 1000, inclusive). Delete every second number in N_{1}. The result is N_{2} = {1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, ..., 999}. Delete every third number in N_{2}. The result is N_{3} = {1, 3, 7, 9, 13, 15, 19, 21, 25, ..., 999}. Delete every fourth number in N_{3}. The result is N_{4} = {1, 3, 7, 13, 15, 19, 25, 27, ...}. ... Delete every tenth number in N_{9}. The result is N_{10}. Find and return the nth element of sequence N_{10}, where n is a 1based index.  
Definition  
 
Notes  
  N_{10} will contain exactly 101 elements.  
Constraints  
  n will be between 1 and 100, inclusive.  
Examples  
0)  
 
1)  
 
2)  
 
3)  
