Find the sum of non-prime divisors of a num between 2 and 2000

#include <iostream>
using namespace std;

//funkciq za namirane na broqt na delitelite
int prime(int x)
{
    if (x <= 1)
    {
        return 1;  // Ne e prosto
    }

    for (int i = 2; i < x; ++i)
    {
        if (x % i == 0)
        {
            return 1;  //Ne e prosto
        }
    }

    return 0;  // Prosto e
}


int br_deliteli(int n)
{
    int result = 0;
    for (int i = 2; i < n; i++)
    {
        if (n % i == 0)
        {
            if (prime(i) == 1)
            {

                result = result + i;
            }
            //return i;

        }

    }
    return result;
}


int main()
{
    //vuvejdane na chislo
    int n;
    cin >> n;
    //proverka dali popada v intervala
    if (n < 2 || n > 2000)
    {
        cout << "Invalid input data!";
        return 0;
    }
    // cout << prime(n)<<"\n";
    cout << br_deliteli(n);
    return 0;
}