![N_{(p)}=n_2\times p^2+n_1\times p^1+n_0\times p^0; \\ N_{(p)}=n_2\times p^2+n_1\times p+n_0, \ \begin {cases} p \in \mathbb Z, \{n_2,n_1,n_0\} \in \mathbb Z \\ n_2 \in [1;p-1], \ \{n_1,n_0\} \in [0;p-1] \\ n_2 \ne n_0 \end {cases}](/tpl/images/0282/1188/e0f7f.png)
![\big((p-1)\times p^2+(p-1)\times p+(p-1)\big)-\big((p^2+0\times p^1+0)\big)200; \\ (p^3-p^2+p^2-p+p-1)-p^2200; \ p^3-1200 \to p \sqrt[3]{200}](/tpl/images/0282/1188/28fa8.png)
/// PascalABC.Net 3.4.2, 2053(11.05.19)
var
a, n: longint;
text: textfile;
function myMod(num, power, divider: longint): longint;
var
rest, i: longint;
begin
rest:=1;
divider := abs(divider);
for i := 1 to power do
begin
rest := rest * num;
rest := rest mod divider;
end;
myMod := rest;
end;
begin
assign(text, 'input.txt');
{rewrite(text);
writeln(text, 109);
close(text);}
reset(text);
read(text, a);
writeln('a=', a);
close(text);
n := 1;
repeat
n := n + 1;
until MyMod(n, n, a) = 0;
assign(text, 'output.txt');
rewrite(text);
writeln(text, n);
close(text);
{reset(text);
read(text, n);
writeln('n=', n);
close(text);}
end.
