#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <algorithm>

#include <assert.h>

#define IOS ios::sync_with_stdio(false)

using namespace std;

#define inf (0x3f3f3f3f)

typedef long long int LL;

#include <iostream>

#include <sstream>

#include <vector>

#include <set>

#include <map>

#include <queue>

#include <string>

#include <bitset>

const int maxn = 1e5 + ;

LL a[maxn], dis[maxn];

LL dp[maxn];

void work() {

    int n;

    cin >> n;

    for (int i = ; i <= n; ++i) cin >> a[i];

    LL ans = ;

    for (int i = ; i <= n - ; ++i) {

        dis[i] = abs(a[i] - a[i + ]);

    }

    for (int i = ; i <= n - ; i += ) {

        dis[i] = -dis[i];

    }

    for (int i = ; i <= n - ; ++i) {

        dp[i] = max(dp[i - ] + dis[i], dis[i]);

        ans = max(ans, dp[i]);

    }

    memset(dp, , sizeof dp);

    for (int i = ; i <= n - ; i += ) {

        dis[i] = -dis[i];

    }

    for (int i = ; i <= n - ; i += ) {

        dis[i] = -dis[i];

    }

    for (int i = ; i <= n - ; ++i) {

        dp[i] = max(dp[i - ] + dis[i], dis[i]);

        ans = max(ans, dp[i]);

    }

    cout << ans << endl;

}

int main() {

#ifdef local

    freopen("data.txt", "r", stdin);

//    freopen("data.txt", "w", stdout);

#endif

    work();

    return ;

}