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

// Node structure
struct Node {
    int data;
    struct Node* next;
};

// Function to create a circular linked list
struct Node* createCircularList(int values[], int n) {
    struct Node* head = (struct Node*)malloc(sizeof(struct Node));
    head->data = values[0];
    struct Node* current = head;

    for(int i = 1; i < n; i++) {
        struct Node* newNode = (struct Node*)malloc(sizeof(struct Node));
        newNode->data = values[i];
        current->next = newNode;
        current = newNode;
    }
    current->next = head; // Make it circular
    return head;
}

// Function to update even-indexed nodes
void updateEvenPositions(struct Node* head, int n) {
    struct Node* current = head;
    int index = 0;
    do {
        if(index % 2 == 0) {
            current->data += 10;
        }
        current = current->next;
        index++;
    } while(current != head);
}

// Function to print the circular list
void printCircularList(struct Node* head, int n) {
    struct Node* current = head;
    int count = 0;
    while(count < n) {
        printf("%d ", current->data);
        current = current->next;
        count++;
    }
    printf("\n");
}

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

    int values[n];
    for(int i = 0; i < n; i++) {
        if(scanf("%d", &values[i]) !=