#include <iostream>
#include <cstdlib>
using namespace std;

struct deramid_node{
	int key;
	int priority;
	deramid_node *left;
	deramid_node *right;
	deramid_node *parent;
};

typedef deramid_node deramid;

void left_rotate(deramid *root, deramid *x){
	deramid *y = x->right;
	x->right = y->left;
	if(y->left != NULL) y->left->parent = x;
	y->parent = x->parent;
	if(x->parent == NULL) root = y;
	else{
		if(x == x->parent->left)	x->parent->left = y;
		else						x->parent->right = y;
	}
	y->left = x;
	x->parent = y;
}

void right_rotate(deramid *root, deramid *x){
	deramid *y = x->left;
	x->left = y->right;
	if(y->right != NULL) y->right->parent = x;
	y->parent = x->parent;
	if(x->parent == NULL) root = y;
	else{
		if(x == x->parent->right)	x->parent->right = y;
		else						x->parent->left = y;
	}
	y->right = x;
	x->parent = y;
}

void deramid_insert(deramid *root, deramid *z){
	deramid *x = root;	//Отмечает проходимый путь
	deramid *y = NULL;	//Ссылается на родительский по отношению к x узел
	
	z->priority = std::rand() % 701;
	while(x != NULL){
		y = x;
		if(z->key < x->key) x = x->left;
		else				x = x->right;
	}
	y = z->parent;
	if(y == NULL) root = z;
	else{
		if(z->key < y->key) y->left = z;
		else				y->right = z;	
	}
}

int main() {
	// your code goes here
	return 0;
}