Java calculates self-power numbers and daffodils

 public static void main(String[] args) {
  Scanner input = new Scanner();
("Please enter the number of self-power digits you want to check:");
int n = ();// Receive number of digits
// Define a number number, starting from 10^(n-1), adding to the end of 10^n
  switch (n) {
  case 1:
("Single Number:");
   ("0" + "\t");
   break;
  case 2:
("Two-digit self-power number:");
("No self-power number!");
   break;
  case 3:
("Narcissus:");
   break;
  case 4:
("Rose Number:");
   break;
  case 5:
("Pentagonal star number:");
   break;
   case 7:
("Big Dipper:");
   break;
  case 8:
("Eight Immortals Number:");
   break;
  case 9:
("Double Ninth and Double Ninth Number:");
   break;
  case 10:
("Perfect Number:");
   break;
  default:
("Other self-power numbers:");
   break;
  }
  for (int number = (int) (10, n - 1); number < (10, n); number++) {
// Judgment condition: The number of digits of the number is n
   if ((number).length() == n) {
    double num = 0;
    for (int i = 0; i < n; i++) {
     int temp = (int) (number / (10, i)) % 10;
     num += (temp, n);
    }
    if (number == num) {
     (number + "\t");
    }
   }
  }
  ();
 }
}