n=gets.chomp[-1].to_i
m=gets.to_i
#trivial
if [0,1,5,6]===n
  puts n
  exit
#Euler's theorem
elsif [3,7,9]===n
  m%=4
  puts (n**m)%10
else
  prod=1
  while m>0
    prod=(prod*n)%10 if m.odd?
    m/=2
    n=(n*n)%10
  end
  puts prod
end