#include <iostream>

using namespace std;
    int prim(int n)
    {
     if (n<2)
        return 0;
     if (n==2)
        return 1;
     if (n%2==0)
        return 0;
    for (int v=3 ; v*v<=n ; v=v+2)
     if(n%v==0)
        return 0;
        return 1;
    }
int main()
{
    int a[101][101] ;
    int m, n, p=0 ;
        cin >> n >> m;
    for (int i=1 ; i<=n; i++)
    {
        for (int j=1 ; j<=m; j++)
            cin>>a[i][j];
    }

    for (int i=2 ; i<=n; i=i+2)
    {

        for (int j=1 ; j<=m; j++)
        if ( prim(a[i][j]) == 1)
            p++ ;
    }
    cout<<p;
    return 0;
}