A#include <stdio.h>
#include <stdlib.h>

#define MAX 110

int stack[MAX], top = -1;

void push(int val) {
    if (top < MAX - 1) {
        stack[++top] = val;
    }
}

int pop() {
    if (top >= 0) {
        return stack[top--];
    }
    return -1; // should not happen
}

int main() {
    int n;
    if (scanf("%d", &n) != 1) {
        printf("Invalid input");
        return 0;
    }
    if (n < 1 || n > 100) {
        printf("Invalid input");
        return 0;
    }

    int arr[n];
    for (int i = 0; i < n; i++) {
        if (scanf("%d", &arr[i]) != 1) {
            printf("Invalid input");
            return 0;
        }
        push(arr[i]);  // push all values into stack
    }

    // Pop values back into array (to simulate circular behavior if needed)
    for (int i = n - 1; i >= 0; i--) {
        arr[i] = pop();
    }

    // Update even index values (+10)
    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            arr[i] += 10;
        }
    }

    // Print updated circular list
    for (int i = 0; i < n; i++) {
        printf("%d ", arr[i]);
    }

    return 0;
}