title: Could someone help me understand what this is asking
body: <p>To help Beta Rabbit crack the lock, write a function answer(n) which returns the smallest positive integer base b, at least 2, in which the integer n is a palindrome. The input n will satisfy "0 &lt;= n &lt;= 1000."</p>
  
  <h1>Test cases</h1>
  
  <p>Inputs:
      (int) n = 0
  Output:
      (int) 2</p>
  
  <p>Inputs:
      (int) n = 42
  Output:
      (int) 4</p>
  
  <p>it is not the problem I need help with as there are similar ones on this site. It is the actual question. this input n they talk about, what the hell does it stand for? It can't be the base as b represents the base. It is not the positive integer they want for output because it is independent of that number and in the test cases it doesn't seem to have any correlation with it. Does it just want me to find the smallest palindrome of any base that's less than 1000 in decimal? Thanks to anyone that takes the time to help me figure this out , it's part of Google's foobar questions. I don't mind doing the work to solve the flecking thing as long as I can understand what the thing is asking.</p>