class Node {
public:
    int data;
    Node *next;
    Node(int value) {
        data = value;
        next = nullptr;
    }
};
 
class Circular_LinkedList {
private:
    Node *start;
public:
    Circular_LinkedList() {
        start = nullptr;
    }
};

class Node:
    def __init__(self, data) -> None:
        self.data = data
        self.next = None
 
class Circular_Linked_List:
    def __init__(self) -> None:
        self.start = None

void insert_beginning(int value) {
    Node *new_node = new Node(value);
    if (start == nullptr) {
        start = new_node;
        new_node->next = start;
    }
    else {
        Node *temp = start;
        while (temp->next != start)
            temp = temp->next;
        temp->next = new_node;
        new_node->next = start;
        start = new_node;
    }
}

def insertBeginning(self, value):
    newNode = Node(value)
    if self.start is None:
        newNode.next = newNode
    else:
        newNode.next = self.start
        ptr = self.start
        while ptr.next != self.start:
            ptr = ptr.next
        ptr.next = newNode
    self.start = newNode

void insert_end(int value) {
    Node *new_node = new Node(value);
    if (start == nullptr) {
        start = new_node;
        new_node->next = start;
    }
    else {
        Node *temp = start;
        while (temp->next != start)
            temp = temp->next;
        temp->next = new_node;
        new_node->next = start;
    }
}

def insertEnd(self, value):
    newNode = Node(value)
    if self.start is None:
        newNode.next = newNode
        self.start = newNode
    else:
        ptr = self.start
        while ptr.next != self.start:
            ptr = ptr.next
        ptr.next = newNode
        newNode.next = self.start

void insert_after(int value, int position) {
    if (start == nullptr) {
        cout << "Linked List is empty!" << endl;
        return;
    }
    Node *temp = start;
    while (temp != nullptr && temp->data != position) {
        temp = temp->next;
    }
    if (temp == nullptr) {
        cout << "No such element found in the List!" << endl;
        return;
    }
    Node *new_node = new Node(value);
    new_node->next = temp->next;
    temp->next = new_node;
}

def insertAfter(self, value, position):
    if self.start is None:
        print("The Linked List is Empty!")
        return
 
    ptr = self.start
    while ptr.data != position:
        ptr = ptr.next
        if ptr == self.start:
            print("No such element found in the List!")
            return
 
    newNode = Node(value)
    newNode.next = ptr.next
    ptr.next = newNode

void delete_beginning() {
    if (start == nullptr) {
        cout << "Linked List is empty!" << endl;
        return;
    }
    Node *temp = start;
    while (temp->next != start)
        temp = temp->next;
    temp->next = start->next;
    delete start;
    start = temp->next;
}

def deleteBeginning(self):
    if self.start is None:
        print("The Linked List is Empty!")
        return
 
    if self.start.next == self.start:
        self.start = None
        return
 
    ptr = self.start
    while ptr.next != self.start:
        ptr = ptr.next
    ptr.next = self.start.next
    self.start = self.start.next

void delete_end() {
    if (start == nullptr) {
        cout << "Linked List is empty!" << endl;
        return;
    }
    Node *temp = start;
    Node *prev = nullptr;
    while (temp->next != start) {
        prev = temp;
        temp = temp->next;
    }
    prev->next = start;
    delete temp;
}

def deleteEnd(self):
    if self.start is None:
        print("The Linked List is Empty!")
        return
 
    if self.start.next == self.start:
        self.start = None
        return
 
    ptr = self.start
    while ptr.next.next != self.start:
        ptr = ptr.next
    ptr.next = self.start

void delete_after(int position) {
    if (start == nullptr) {
        cout << "Linked List is empty!" << endl;
        return;
    }
    Node *temp = start;
    while (temp != nullptr && temp->data != position) {
        temp = temp->next;
    }
    if (temp == nullptr) {
        cout << "No such element found in the List!" << endl;
        return;
    }
    Node *del_node = temp->next;
    temp->next = del_node->next;
    if (del_node == start) {
        start = temp->next;
    }
    delete del_node;
}

def deleteAfter(self, position):
    if self.start is None:
        print("The Linked List is Empty!")
        return
 
    ptr = self.start
    while ptr.data != position:
        ptr = ptr.next
        if ptr == self.start:
            print("No such element found in the List!")
            return
 
    ptr.next = ptr.next.next

void display() {
    if (start == nullptr) {
        cout << "Linked List is empty!" << endl;
        return;
    }
    Node *temp = start;
    while (temp->next != start) {
        cout << temp->data << " ";
        temp = temp->next;
    }
    cout << temp->data << endl;
}

def display(self):
    if self.start is None:
        print("The Linked List is Empty!")
        return
 
    ptr = self.start
    print('Elements in the Linked List are:')
    while True:
        print(ptr.data, end="\t")
        ptr = ptr.next
        if ptr == self.start:
            break