#include <bits/stdc++.h>
using namespace std;
class Solver {
private:
bool isPrime(int n) {
if (n <= 1) return false;
for (int i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
bool isValidNum(int num) {
return num % 10 == 1 || num % 10 == 9;
}
public:
int getSumInRange(int l, int r) {
if (l > r) swap(l, r);
int sum = 0;
for (int i = l; i <= r; i++) {
if (isValidNum(i)) {
sum += isPrime(i) ? i : 0;
}
}
return sum;
}
};
int32_t main() {
Solver* solver = new Solver();
cout << solver->getSumInRange(100, 200) << endl;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKY2xhc3MgU29sdmVyIHsKcHJpdmF0ZToKCWJvb2wgaXNQcmltZShpbnQgbikgewoJCWlmIChuIDw9IDEpIHJldHVybiBmYWxzZTsKCQlmb3IgKGludCBpID0gMjsgaSAqIGkgPD0gbjsgaSsrKSB7CgkJCWlmIChuICUgaSA9PSAwKSAKCQkJCXJldHVybiBmYWxzZTsKCQl9CgkJcmV0dXJuIHRydWU7Cgl9CgkKCWJvb2wgaXNWYWxpZE51bShpbnQgbnVtKSB7CgkJcmV0dXJuIG51bSAlIDEwID09IDEgfHwgbnVtICUgMTAgPT0gOTsKCX0KcHVibGljOgoJaW50IGdldFN1bUluUmFuZ2UoaW50IGwsIGludCByKSB7CgkJaWYgKGwgPiByKSBzd2FwKGwsIHIpOwoJCQoJCWludCBzdW0gPSAwOwoJCWZvciAoaW50IGkgPSBsOyBpIDw9IHI7IGkrKykgewoJCQlpZiAoaXNWYWxpZE51bShpKSkgewoJCQkJc3VtICs9IGlzUHJpbWUoaSkgPyBpIDogMDsKCQkJfQoJCX0KCQlyZXR1cm4gc3VtOwoJfQp9OwogCmludDMyX3QgbWFpbigpIHsKCVNvbHZlciogc29sdmVyID0gbmV3IFNvbHZlcigpOwoJY291dCA8PCBzb2x2ZXItPmdldFN1bUluUmFuZ2UoMTAwLCAyMDApIDw8IGVuZGw7Cn0=