#include <iostream>
#include<vector>
#include<algorithm>
using namespace std;
int num[100];
int main()
{
    vector<int>A;
    int n, Bitc, even = 0, odd = 0, counter = 0;
    cin >> n >> Bitc;
    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }

    for (int i = 0; i < n; i++) {
        if (i != 0 && even == odd) {
            A.push_back(abs(num[i] - num[i - 1]));
        }
        if (num[i] % 2 == 0) {
            even++;
        }
        else {
            odd++;
        }
    }
    sort(A.begin(), A.end());
    for (int i = 0; i < A.size(); i++) {
        if (Bitc >= A[i]) {
            counter++;
            Bitc -= A[i];
        }
    }
    cout << counter << endl;

}