// console.log("I'm Ready!");

// var hacker1 = "Jack";

// // console.log("The driver's name is " + hacker1);

// var hacker2 = prompt("What is the navigator's name?");
// console.log("The navigator's name is " + hacker2);

// // if (hacker1.length > hacker2.length) {
// //   console.log("The Driver has the longest name, it has " +  hacker1.length + " characters");
// // }

// // else if (hacker1.length < hacker2.length) {
// //   console.log("Yo, navigator got the longest name, it has " + hacker2.length + " characters");
// // }

// // else if  (hacker1.length === hacker2.length) {
// //   console.log("wow, you both got equally long names, " + hacker2.length + " characters!!");
// // }
// var string = "";
// for (var i = 0; i < hacker1.length; i++) {
//   string += hacker1.toUpperCase()[i] + " ";
// }

// console.log(string);

// var string2 = ''
// for (var j = 0; j < hacker2.length; j++) {
//   string2 += hacker2[hacker2.length - j - 1];
// }

// console.log(string2)

// if (hacker1 < hacker2) {
// console.log('The driver\'s name goes first')
// }
// else if (hacker2 < hacker1) {
// console.log('Yo, the navigator goes first definitely')
// }
// else if (hacker1 === hacker2) {
// console.log('What?! You both got the same name?')
// }

var palindrome = prompt("Down here check if that is a palindrome.");

var palindrome = palindrome.toUpperCase()
var palindromeBackwards = ''
var palindromeClean = ''

for (var k = 0; k < palindrome.length; k++) {
  if (palindrome[palindrome.length - k - 1] <= 'Z' && palindrome[palindrome.length - k - 1] >= 'A') {
    palindromeBackwards += palindrome[palindrome.length - k - 1];
  }
  if (palindrome[k] >= 'A' && palindrome[k] <= 'Z')
  palindromeClean += palindrome[k]
}
console.log(palindromeClean + " " + palindromeBackwards)

if (palindromeBackwards.toUpperCase() === palindromeClean) {
  console.log("It is!");
}

else {
  console.log("It isn't.");
}