#include<stdio.h>
int main()
{
int st, en, sum = 0, sm , res;
//st=시작, en=끝 sum=소수합, sm=최소, res가 0이라면 소수
int i;
scanf("%d %d", &st, &en);
sm = 100000;
for (st; st <= en; st++)
{
res = 0;
if (st == 1) res = 1; //1 소수 x
if (st == 2) sm = st; //2 소수이면서 최소
for (i = 2; i < st; i++)
{
if ((st % i) == 0) //소수 x
{
res = 1;
break;
}
else //소수 o
{
if (sm > st) sm = st;
continue;
}
}
if (res == 0) //소수끼리 합
{
sum += st;
}
}
if (sum == 0) //소수 하나도 없었으면
{
printf("-1");
}
else
{
printf("%d\n%d", sum, sm);
}
}
I2luY2x1ZGU8c3RkaW8uaD4KCmludCBtYWluKCkKewoJaW50IHN0LCBlbiwgc3VtID0gMCwgc20gLCByZXM7ICAgIAogICAgLy9zdD3si5zsnpEsIGVuPeuBnSBzdW097IaM7IiY7ZWpLCBzbT3stZzshowsIHJlc+qwgCAw7J20652866m0IOyGjOyImAoJaW50IGk7CglzY2FuZigiJWQgJWQiLCAmc3QsICZlbik7CglzbSA9IDEwMDAwMDsKCWZvciAoc3Q7IHN0IDw9IGVuOyBzdCsrKQoJewoJCXJlcyA9IDA7CgkJaWYgKHN0ID09IDEpIHJlcyA9IDE7ICAgIC8vMSDshozsiJggeAoJCWlmIChzdCA9PSAyKSBzbSA9IHN0OyAgICAvLzIg7IaM7IiY7J2066m07IScIOy1nOyGjAoJCWZvciAoaSA9IDI7IGkgPCBzdDsgaSsrKQoJCXsKCQkJaWYgKChzdCAlIGkpID09IDApICAgIC8v7IaM7IiYIHgKCQkJewoJCQkJcmVzID0gMTsKCQkJCWJyZWFrOwoJCQl9CgkJCWVsc2UgICAgICAgICAgICAgICAgICAvL+yGjOyImCBvCgkJCXsKCQkJCWlmIChzbSA+IHN0KSBzbSA9IHN0OwoJCQkJY29udGludWU7CgkJCX0KCQl9CgkJaWYgKHJlcyA9PSAwKSAgICAgICAgICAgICAvL+yGjOyImOuBvOumrCDtlakKCQl7CgkJCXN1bSArPSBzdDsKCQl9Cgl9CglpZiAoc3VtID09IDApICAgICAgICAgICAgICAgICAgLy/shozsiJgg7ZWY64KY64+EIOyXhuyXiOycvOuptAoJewoJCXByaW50ZigiLTEiKTsKCX0KCWVsc2UKCXsKCQlwcmludGYoIiVkXG4lZCIsIHN1bSwgc20pOwoJfQp9