#include<stdio.h>
#include<stdlib.h>
struct Node{
    int data;
    struct Node*next;
    struct Node*prev;
};
struct Node*createNode(int value){
    struct Node* newNode=(struct Node*)malloc(sizeof(struct Node));
    newNode->data=value;
    newNode->next=newNode->prev=NULL;
    return newNode;
}
int main(){
    int n;
    if(scanf("%d",&n)!=1||n<1||n>100){
        printf("Inavlid input\n");
        return 0;
    }
    struct Node*head=NULL;
    struct Node*tail=NULL;
    for(int i=0;i<n;i++){
        int value;
        if(scanf("%d",&value)!=1){
            printf("Invalid input\n");
            return 0;
        }
        struct Node*newNode=createNode(value);
        if(head==NULL){
            head=tail=newNode;
            head->next=head->prev=head;
        }else{
            newNode->prev=tail;
            newNode->next=head;
            tail->next=newNode;
            tail=newNode;
        }
    }
    struct Node* current=head;
    int index=0;
    do{
        if(index%2==0){
            current->data+=10;
        }
        current=current->next;
        index++;
    }while(current !=head);
    current=head;
    do{
        printf("%d",current->data);
        current=current->next;
        if(current!=head)printf(* *);
    }while(current!=head);
    printf("\n");
    return 0;
}