A Munchausen number is a natural number n the sum of whose digits (in base 10), each raised to the power of itself, equals n.

(Munchausen is also spelled: Münchhausen.)

For instance:    3435 = 33 + 44 + 33 + 55 



Task
Find all Munchausen numbers between   1   and   5000.



Also see

 The OEIS entry:  A046253
 The Wikipedia entry:  Perfect digit-to-digit invariant, redirected from Munchausen Number


  For(I,1,5000)
    0→S:I→K
    For(J,1,4)
      10^(4-J)→D
      iPart(K/D)→N
      remainder(K,D)→R
      If N≠0:S+N^N→S
      R→K
    End
    If S=I:Disp I
  End 