From Wikipedia, the free encyclopedia:

 A happy number is defined by the following process:
 Starting with any positive integer, replace the number by the sum of the squares of its digits, and repeat the process until the number equals   1   (where it will stay),   or it loops endlessly in a cycle which does not include   1.   


 Those numbers for which this process end in   1   are       happy   numbers,   
 while   those numbers   that   do   not   end in   1   are   unhappy   numbers. 


Task

Find and print the first   8   happy numbers.

Display an example of your output here on this page.



See also

   The OEIS entry:   The     happy numbers:   A007770
   The OEIS entry:   The unhappy numbers;   A031177


 
  [ 0 swap
    [ 10 /mod 2 **
      rot + swap
      dup 0 = until ]
    drop ]                  is digitsquare ( n --> n )
 
  [ [ digitsquare
      dup  1 != while
      dup 42 != while
      again ]
    1 = ]                   is happy       ( n --> b )
 
  [ [] 1               
    [ dip 
      [ 2dup size > ]
      swap while
      dup happy if
        [ tuck join swap ]
      1+ again ] 
    drop nip ]             is happies      ( n --> [ )
 
  8 happies echo