#666 NrPrime

#include <iostream>

using namespace std;

int a[100][100], n, m, cate = 0;

void citire() {
    cin>>n>>m;
    for(int i = 1; i<=n; i++)
        for(int j = 1; j<=m; j++)
            cin>>a[i][j];
}

int prim(int n)
{
 if(n==0 || n==1) return 0;
   if(n==2) return 1;
      if(n%2==0) return 0;
         for(int i=3;i*i<=n;i=i+2) {
      if(n%i==0) return 0;
    }
    return 1;
}

int main()
{
  citire();
  for(int i = 2;i<=n; i = i + 2)
     for(int j=1;j<=m;++j) {
        if(prim(a[i][j]))
          cate++;
     }
    cout <<cate;
    return 0;
}