// <!-- 2122313105
// This script is (C) Copyright 2004 Jim Tucek
// Leave these comments alone!  For more info, visit
// www.jracademy.com/~jtucek/ 

function find(alchemy,ring,animal) {
alchemy += ' ';
var assistant = alchemy.length;
var hair = 0;
var sky = '';
for(var tail = 0; tail < assistant; tail++) {
hair = 0;
while(alchemy.charCodeAt(tail) != 32) {
hair = hair * 10;
hair = hair + alchemy.charCodeAt(tail)-48;
tail++;
}
sky += String.fromCharCode(split(hair,ring,animal));
}
parent.location = 'm'+'a'+'i'+'l'+'t'+'o'+':'+sky;
}

function knit(computer,opposite,tremor) {
computer += ' ';
var expert = computer.length;
var gynecology = 0;
for(var government = 0; government < expert; government++) {
gynecology = 0;
while(computer.charCodeAt(government) != 32) {
gynecology = gynecology * 10;
gynecology = gynecology + computer.charCodeAt(government)-48;
government++;
}
//document.write('&');
//document.write('#');
//document.write(split(gynecology,opposite,tremor));
document.write(String.fromCharCode(split(gynecology,opposite,tremor)));
}
}

function split(game,broad,mother) {
if (mother % 2 == 0) {
matrix = 1;
for(var memory = 1; memory <= mother/2; memory++) {
maximum = (game*game) % broad;
matrix = (maximum*matrix) % broad;
}
} else {
matrix = game;
for(var wall = 1; wall <= mother/2; wall++) {
maximum = (game*game) % broad;
matrix = (maximum*matrix) % broad;
}
}
return matrix;
}
// -->