#include <iostream>
using namespace std;
int main() {
int n, sum_result = 0, val1, val2;
cin >> n;
for (int i = 1; i <= n; i += 2) {
cin >> val1;
sum_result -= val1; // poziție impară (scădem)
if (i + 1 < n) {
cin >> val2;
sum_result += val2; // poziție pară (adunăm)
}
}
cout << sum_result;
return 0;
}
/*#include <iostream>
using namespace std;
const int MAX_LENGTH = 100000;
int main() {
int n, v[MAX_LENGTH + 1], sum_even_no = 0, sum_odd_no = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
int i = 1;
while (i <= n) {
if (i % 2 == 0) {
sum_even_no += v[i];
} else {
sum_odd_no += v[i];
}
++i;
}
cout << sum_even_no - sum_odd_no;
return 0;
}
*/
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4oKSB7CiAgICBpbnQgbiwgc3VtX3Jlc3VsdCA9IDAsIHZhbDEsIHZhbDI7CiAgICBjaW4gPj4gbjsKCiAgICBmb3IgKGludCBpID0gMTsgaSA8PSBuOyBpICs9IDIpIHsKICAgICAgICBjaW4gPj4gdmFsMTsKICAgICAgICBzdW1fcmVzdWx0IC09IHZhbDE7IC8vIHBvemnIm2llIGltcGFyxIMgKHNjxINkZW0pCiAgICAgICAgaWYgKGkgKyAxIDwgbikgewogICAgICAgICAgICBjaW4gPj4gdmFsMjsKICAgICAgICAgICAgc3VtX3Jlc3VsdCArPSB2YWwyOyAvLyBwb3ppyJtpZSBwYXLEgyAoYWR1bsSDbSkKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBzdW1fcmVzdWx0OwogICAgcmV0dXJuIDA7Cn0KLyojaW5jbHVkZSA8aW9zdHJlYW0+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKY29uc3QgaW50IE1BWF9MRU5HVEggPSAxMDAwMDA7CiAKaW50IG1haW4oKSB7CmludCBuLCB2W01BWF9MRU5HVEggKyAxXSwgc3VtX2V2ZW5fbm8gPSAwLCBzdW1fb2RkX25vID0gMDsKY2luID4+IG47CmZvciAoaW50IGkgPSAxOyBpIDw9IG47ICsraSkgewpjaW4gPj4gdltpXTsKfQppbnQgaSA9IDE7CndoaWxlIChpIDw9IG4pIHsKaWYgKGkgJSAyID09IDApIHsKc3VtX2V2ZW5fbm8gKz0gdltpXTsKfSBlbHNlIHsKc3VtX29kZF9ubyArPSB2W2ldOwp9CisraTsKfQpjb3V0IDw8IHN1bV9ldmVuX25vIC0gc3VtX29kZF9ubzsKcmV0dXJuIDA7Cn0KKi8=