fefractoring

#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;

int main()
{
    cout << "Type your N: " << endl;
    int n;
    cin >> n;
    n++;
    int* mas = new int[n];
    int summ_of_mid = 0;
    for (int i = 0; i<=(n-2); i++)
    {
        mas[i] = rand() - RAND_MAX/2;
        cout << mas[i] << endl;
        summ_of_mid += mas[i];
    }
    cout << "Middle number is: " << (summ_of_mid /= n) << endl;
    mas[n-1] = summ_of_mid;
    sort(mas, mas+n);
    int best_n(0);
    for (int i = 0; i <=(n-1); i++)
    {
        if (mas[i]==summ_of_mid)
        {
            if (mas[i+1]<0) {mas[i+1]=abs(mas[i+1]+mas[i+1]+1);}
            if (mas[i-1]<0) {mas[i-1]=abs(mas[i-1]+mas[i-1]+1);}
            best_n = ((mas[i+1]+summ_of_mid)>(mas[i-1]+summ_of_mid)) ? mas[i-1] : mas[i+1];
        }
    }
    cout << "Your best number is: " << best_n << endl;
    system("pause");
    delete []mas;
    return 0;
}