import java.util.*; class UserMainCode { public String transformSquareAlphabet(String input1) { int n = input1.length(); StringBuilder result = new StringBuilder(); for (int i = 0; i < n; i++) { char currentChar = input1.charAt(i); int pos = currentChar - 'a' + 1; // Check if position is a perfect square int sqrt = (int) Math.sqrt(pos); if (sqrt * sqrt == pos) { int K = sqrt; char replaceChar = (char) ('a' + K - 1); boolean keepOriginal = false; // Check left neighbor if (i > 0) { int leftPos = input1.charAt(i - 1) - 'a' + 1; if (leftPos == K) { keepOriginal = true; } } // Check right neighbor if (i < n - 1) { int rightPos = input1.charAt(i + 1) - 'a' + 1; if (rightPos == K) { keepOriginal = true; } } if (keepOriginal) { result.append(currentChar); } else { result.append(replaceChar); } } else { result.append(currentChar); // Not a perfect square } } return result.toString(); } } //transformsquarealphabet