if (n % i == 0) {
v.push_back(i);

// condition to check the
// divisor is not the number itself
if (n / i != i) {
v.push_back(n / i);
}
}
}
// return the vector
return v;
}

// Function to check if the number
// is abundant or not
bool checkAbundant(int n)
{
vector<int> v;

int sum = 0;

// find the divisors using function
v = factors(n);

// sum all the factors
for (int i = 0; i < v.size(); i++) {
sum += v[i];