Here is a main function that will use the isPrime function provided by you to print the first 20 prime numbers.

```
#include <iostream>
using namespace std;

bool isPrime(int n)
{
    if(n == 1 || n == 0) return false;
    for(int i = 2; i < n; i++)
    {
        if(n % i == 0) return false;
    }
    return true;
}

int main()
{
    int count = 0;
    int num = 2;
    
    while(count < 20)
    {
        if(isPrime(num))
        {
            cout << num << endl;
            count++;
        }
        num++;
    }
    
    return 0;
}
```
spam fails_task lang_mismatch pii not_appropriate hate_speech sexual_content quality toxicity humor helpfulness creativity violence