#include <iostream>
using namespace std;
int prim(int x){
int d;
if(x==0||x==1||(x%2==0&&x!=2))
return 1;
for(d=3;d*d<=x;d+=2)
if(x%d==0)
return 1;
return 0;}
int a[101][101], i, n, m, j, nrprime;
int main(){
cin>>n>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
cin>>a[i][j];
}
for(i=2;i<=n;i+=2)
for(j=2;j<=m;j+=2)
if(prim(a[i][j]==0))
nrprime++;
cout<<nrprime;}