// 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.
// 1
#include <iostream>
int main() {
int n;
std::cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; ++i)
std::cin >> arr[i];
int count = 0;
for (int i = 0; i < n; ++i)
if (arr[i] > 0)
count++;
std::cout << count;
}
// 2
#include <iostream>
int main() {
int n;
std::cin >> n;
double *arr = new double[n];
for (int i = 0; i < n; ++i)
std::cin >> arr[i];
double k;
std::cin >> k;
int count = 0;
for (int i = 0; i < n; ++i)
if (arr[i] == k)
count++;
std::cout << count;
}
// 3
#include <iostream>
int main() {
int n;
std::cin >> n;
int *arr = new int[n];
for (int i = 0; i < n; ++i)
std::cin >> arr[i];
long long multi = 1;
for (int i = 0; i < n; ++i)
if (arr[i] % 2 != 0)
multi *= arr[i];
std::cout << multi;
}