#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
long long int n;
long long int v[N];
vector<long long int> a, b;
long long int solve(const vector<long long int> &vet) {
  long long int max_so_far = INT_MIN, max_ending_here = 0;
  for (int i = 0; i < vet.size(); i++) {
    max_ending_here = max_ending_here + vet[i];
    if (max_so_far < max_ending_here) max_so_far = max_ending_here;
    if (max_ending_here < 0) max_ending_here = 0;
  }
  return max_so_far;
}
int main() {
  scanf("%lld", &n);
  for (int i = 0; i < n; ++i) {
    scanf("%lld", &v[i]);
  }
  for (int i = 1; i < n; ++i) {
    a.push_back(abs(v[i] - v[i - 1]) * ((i & 1) ? 1 : -1));
    b.push_back(abs(v[i] - v[i - 1]) * ((i & 1) ? -1 : 1));
  }
  printf("%lld\n", max(solve(a), solve(b)));
  return 0;
}
