public class BrotherPrime {
public static void main(String[] args) {
int count = 0;
int lastPrime = 1;
for(int i = 2;i <= 100;i++) {
boolean flag = true;
for(int j = 2;j< i;j++) {
if(i%j == 0) {
flag = false;
break;
}
}
if(flag == true) {
if(i - lastPrime == 2) {
count++;
}
lastPrime = i;
}
}
System.out.println(count);
}
}