RosettaCodeData/Task/Babbage-problem/Asymptote/babbage-problem.asymptote

int n = 519;

while (269696 != (n^2) % 1000000) {
  ++n;
}

write("The smallest number whose square ends in 269696 is: ", n);
write("It's square is ", n*n);