All Prime Number Less than N

#include <iostream>
using namespace std;

int main()
{
    int number;
    cout << "Enter number: ";
    cin >> number;
    cout << "\nPrime numbers until " << number << " are:\n";
    for(int i = 2; i <= number; i++)
    {
        bool isNumPrime = true;
        for(int j = 2; j < i; j++)
        if(i % j == 0)
        {
            isNumPrime = false;
            break;
        }

        if(isNumPrime)
        {
            cout << i << endl;
        }
    }

    return 0;
}