Top Shell

Here is a first cut at an algorithm

• Ask the user which number he wants to find
• Initialize counter to 0.
• Start current from 1
• Keep going as follows until we get enough numbers
  • have we found enough numbers. if yes stop trying more.
  • Test current number. if it is a 235-number increment counter.
  • move to next number
• Print the answer on the screen