Find a number is Armstrong or Not?

import java.io.;
import java.util.;

public class Solution
{
static int Power(int a,int b)
{
int f=1;
for(int i=1;i<=b;i++)
{
f=f*a;
}
return f;
}
static int Count(int n)
{
int c=0;
while(n>0)
{
n=n/10;
c++;
}
return c;
}
static void Armstrong(int n)
{
int c=Count(n),s=0,dup=n;
while(n>0)
{
int r=n%10;
s=s+Power(r,c);
n=n/10;
}
if(s==dup)
{
System.out.print("Armstrong Number");
}
else
{
System.out.print("Not an Armstrong Number");
}
}
public static void main(String[] args)
{
Scanner s=new Scanner(System.in);
int n=s.nextInt();
Armstrong(n);
}
}