Test case 0,1 are worng

#1

import java.util.*;
public class Main {

public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n= sc.nextInt();
if(0<=n && n<= 1000000000){
System.out.println(Armstrong(n));
}
}

public static boolean Armstrong(int n)
{
    int a = 0;
    int b= 0;
    int temp = n;
    boolean Armstrongno = true;
    while(n!=0)
    {
        a = n%10;
        b = b + (a * a * a);
        n= n/10;
    }
    if(temp == b)
    {
        return Armstrongno;
    }
    else
    {
        Armstrongno = false;
        return Armstrongno;
    }

}

}

#2

hey @himanshusingh2389_63aac7fac0c69386 you are getting wrong answer because you are always taking cube of the digit.But that is not the case
because you take power which is length of the number.
For eg = 3451
if arm strong you have to check.
length = 4
if 3^4 + 4^4 + 5^4 + 1^4.not raise to power 3.