Lrae's puzzle solution

public class numberLetterCounts {
    public static void main(String[]args)  {


            String encrypted = "tearsr svyeems# @#7aa%bee c";

            StringBuilder woodenDecrypt = new StringBuilder();
            int vPlace = 0;
            for(int p = 2700; p != 2727; p++) { //password has 27 different starting positions
                for(int i = 1; i != 29; i = (2667 + i)%64) { //goes through 20 iterations with
                                                             //27 different inputs from p
                    woodenDecrypt.append(encrypted.charAt((i + p)%27));
                }                          //this tests all 27 permutations
                char v = '*';              //finds the 1 v in decrypted string
                int findV = 0;
                String hold = woodenDecrypt.toString();  //converts woodenDecrypt to string
                for(findV = 0, vPlace = 0; findV != 20; findV++) {  //finds the place of 'v'
                    v = hold.charAt(findV);
                    if(v == 'v')
                    vPlace = findV;
                }
                if(vPlace <= 17) {   //if v is in the 18th or less position && '#' and 'r' follow after
                    if((hold.charAt(1 + vPlace) == '#') && (hold.charAt(2 + vPlace) == 'r')) {

                        hold = hold.replace("v#r", "ge");    //replacement will be made
                        System.out.println(hold);            //print out iterations where 'v#r' is in order

                    }
                }
                woodenDecrypt.delete(0, 20);  //reset stringbuilder variable so nothing is appended
                                                   //between iterations
            }

            String hashy = "mark", hey = "mark";
            if((hashy.hashCode()) == hey.hashCode())
            System.out.print("hashcodes are comparable.");
    }
}