// PascalABC.NET 3.6.3
uses School;
function Divizors(n: integer): List<integer>;
begin
var L := new List<integer>;
L.Add(1);
L.Add(n);
if n > 3 then
begin
var k := 2;
while (k * k <= n) and (k < 46341) do
begin
if n mod k = 0 then
begin
var t := n div k;
L.Add(k);
if k < t then L.Add(t)
else break
end;
Inc(k)
end;
L.Sort;
end;
Result := L
end;
begin
// 1
if ReadInteger.IsPrime then Println('YES')
else Println('NO');
// 2
ReadInteger.Factorize.First.Println;
// 3
var a := Divizors(ReadInteger);
Print(a.Count, a.Sum)
end.
using namespace std;
int main() {
bool flag = false;
while (true) {
char space = ' ', asterisk = '*';
int s = 11, a = 1, i, j;
while (s != 0) {
i = s;
while (i--) cout << space;
j = a;
while (j--) cout << asterisk;
cout << '\n';
--s;
a += 2;
if (flag) break;
}
if (flag) break;
flag = true;
}
cin.get();
}