#include <bits/stdc++.h>
using namespace std;
long long power(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
long long int binomial(long long int n, long long int k) {
  long long int C[k + 1];
  memset(C, 0, sizeof(C));
  C[0] = 1;
  for (long long int i = 1; i <= n; i++) {
    for (int j = min(i, k); j > 0; j--) C[j] = C[j] + C[j - 1];
  }
  return C[k];
}
vector<int> pr;
bool prime[10000000];
void Sieve(long long int n) {
  memset(prime, true, sizeof(prime));
  prime[1] = false;
  for (int p = 2; p * p <= n; p++) {
    if (prime[p] == true) {
      pr.push_back(p);
      for (int i = p * p; i <= n; i += p) prime[i] = false;
    }
  }
}
pair<int, int> fib(int n) {
  if (n == 0) return {0, 1};
  auto p = fib(n >> 1);
  int c = p.first * (2 * p.second - p.first);
  int d = p.first * p.first + p.second * p.second;
  if (n & 1)
    return {d, c + d};
  else
    return {c, d};
}
void reverse(string& str) {
  int n = str.length();
  for (int i = 0; i < n / 2; i++) swap(str[i], str[n - i - 1]);
}
int sum(int n) {
  if (n == 0) return 0;
  return (n % 10 + sum(n / 10));
}
int main() {
  long long int n;
  cin >> n;
  long long int a[n];
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long int s1 = 0, s2 = 0;
  long long int st = 1;
  long long int m1 = 0, m2 = 0;
  for (int i = 0; i < n - 1; i++) {
    s1 += (st) * (abs(a[i] - a[i + 1]));
    s2 += (-st) * (abs(a[i] - a[i + 1]));
    st *= -1;
    if (s1 < 0) {
      s1 = 0;
    }
    if (s2 < 0) {
      s2 = 0;
    }
    m1 = max(m1, s1);
    m2 = max(m2, s2);
  }
  cout << max(m1, m2) << endl;
}
