package main

import (
	"bufio"
	"bytes"
	"fmt"
	"io"
	"os"
	"strconv"
)

// -----------------------------------------------------------------------------

// IO helper functions

// Returns next token from input.  It must be initialized by SetInput()
// before the first call.
var nextToken func() ([]byte, error)
var nextLine func() ([]byte, error)

// Holds a buffer for output.  It must be initialized by SetOutput().
// All IO fucntions (read*() and [e]print*()) should write to OutputWriter
// instead of this.
var OutputBuffer *bufio.Writer

// Holds an io.Writer.  It must be initialized by SetOutput()
var OutputWriter io.Writer

// Set IO functions for interactive input/output.
func SetInteractive(w io.Writer, r io.Reader) {
	SetUnbefferedInput(r)
	OutputBuffer = nil
	OutputWriter = w
}

// Setup OutputBuffer and OutputWriter.
func SetOutput(w io.Writer) {
	OutputBuffer = bufio.NewWriter(w)
	OutputWriter = OutputBuffer
}

// Flushes OutputBuffer
func Flush() {
	if OutputBuffer != nil {
		OutputBuffer.Flush()
	}
}

// Returns true if c is a white space
func IsSpace(c byte) bool {
	switch c {
	case '\t', '\n', '\v', '\f', '\r', ' ':
		return true
	}
	return false
}

func IsNewLine(c byte) bool {
	switch c {
	case '\n', '\r':
		return true
	}
	return false
}

// Setup nextToken with input buffer.
func SetInput(r io.Reader) {
	buf := new(bytes.Buffer)
	var b []byte

	var i int
	rest := func() ([]byte, error) {
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		return b[j:i], nil
	}
	initial := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextToken = rest
		return rest()
	}
	nextToken = initial

	restLn := func() ([]byte, error) {
		for i < len(b) && IsNewLine(b[i]) {
			i++
		}
		if i == len(b) {
			return nil, io.ErrUnexpectedEOF
		}
		j := i
		for i < len(b) && !IsNewLine(b[i]) {
			i++
		}
		return b[j:i], nil
	}

	initialLn := func() ([]byte, error) {
		io.Copy(buf, r)
		b = buf.Bytes()
		nextLine = restLn
		return restLn()
	}
	nextLine = initialLn
}

// Setup nextToken without input buffer.
func SetUnbefferedInput(r io.Reader) {
	buf := bufio.NewReader(r)
	var b []byte

	var i int
	nextToken = func() ([]byte, error) {
		var err error
		if i == len(b) {
			b, err = buf.ReadBytes('\n')
			if err != nil {
				return nil, err
			}
			i = 0
			j := len(b) - 1
			for 0 <= j && IsSpace(b[j]) {
				j--
			}
			b = b[0 : j+1]
		}
		for i < len(b) && IsSpace(b[i]) {
			i++
		}
		j := i
		for i < len(b) && !IsSpace(b[i]) {
			i++
		}
		if i == j {
			return nil, io.ErrUnexpectedEOF
		}
		return b[j:i], nil
	}
}

// -----------------------------------------------------------------------------

// IO functions

// Reads next token and return it as []byte
func readb() []byte {
	b, err := nextToken()
	if err != nil {
		panic(err)
	}
	return b
}

// Reads next token and return it as string
func reads() string {
	return string(readb())
}

// Read next line as []byte
func readbln() []byte {
	b, err := nextLine()
	if err != nil {
		panic(err)
	}
	return b
}

// Read next line as string
func readsln() string {
	return string(readbln())
}

// Reads next token and return it as int64
func readll() int64 {
	i, err := strconv.ParseInt(reads(), 10, 64)
	if err != nil {
		panic(err.Error())
	}
	return i
}

// Reads next token and return it as int
func readi() int {
	return int(readll())
}

// Reads next token and return it as float64
func readf() float64 {
	f, err := strconv.ParseFloat(reads(), 64)
	if err != nil {
		panic(err.Error())
	}
	return f
}

// Write args to OutputWriter with the format f
func printf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(OutputWriter, f, args...)
}

// Write args to OutputWriter without format
func println(args ...interface{}) (int, error) {
	return fmt.Fprintln(OutputWriter, args...)
}

// Write args to stderr with the format f
func eprintf(f string, args ...interface{}) (int, error) {
	return fmt.Fprintf(os.Stderr, f, args...)
}

// Write args to stderr without format
func eprintln(args ...interface{}) (int, error) {
	return fmt.Fprintln(os.Stderr, args...)
}

// -----------------------------------------------------------------------------

// Simple math functions

const (
	// big prime
	INF  = 1000000007
	INF2 = 1000000009
	INF3 = 998244353
)

func min(a, b int) int {
	if a < b {
		return a
	}
	return b
}

func minll(a, b int64) int64 {
	if a < b {
		return a
	}
	return b
}

func max(a, b int) int {
	if a < b {
		return b
	}
	return a
}

func maxll(a, b int64) int64 {
	if a < b {
		return b
	}
	return a
}

func abs(a int) int {
	if a < 0 {
		return -a
	}
	return a
}

func absll(a int64) int64 {
	if a < 0 {
		return -a
	}
	return a
}

// egcd(a, b) returns d, x, y:
//   d is gcd(a,b)
//   x, y are  integers that satisfy ax + by = d
func egcd(a, b int) (int, int, int) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcd(b, a%b)
	return d, y, x - a/b*y
}

func egcdll(a, b int64) (int64, int64, int64) {
	if b == 0 {
		return a, 1, 0
	}
	d, x, y := egcdll(b, a%b)
	return d, y, x - a/b*y
}

func gcd(a, b int) int {
	d, _, _ := egcd(a, b)
	return d
}

func gcdll(a, b int64) int64 {
	d, _, _ := egcdll(a, b)
	return d
}

// set up IO functions
func init() {
	// for non-interactive
	SetInput(os.Stdin)
	SetOutput(os.Stdout)

	// Enable below when interactive.  Its ok to leave above intact.
	// SetInteractive(os.Stdout, os.Stdin)
}

func main() {
	defer Flush()

	m := readi()
	var t *TreapNode
	for i := 0; i < m; i++ {
		var k, p int
		cmd := reads()
		switch cmd {
		case "insert":
			k = readi()
			p = readi()
			t = t.Insert(k, p)
		case "find":
			k = readi()
			if t.Find(k) {
				println("yes")
			} else {
				println("no")
			}
		case "delete":
			k = readi()
			t = t.Delete(k)
		case "print":
			for _, v := range t.KeysInorder() {
				printf(" %d", v)
			}
			println()
			for _, v := range t.KeysPreorder() {
				printf(" %d", v)
			}
			println()
		}
	}

}

type Treap struct {
	*TreapNode
}

type TreapNode struct {
	key, priority int
	right, left   *TreapNode
}

func (t *TreapNode) Insert(key, prio int) *TreapNode {
	if t == nil {
		t = new(TreapNode)
		t.key = key
		t.priority = prio
		return t
	}

	if key < t.key {
		t.left = t.left.Insert(key, prio)
		if t.priority < t.left.priority {
			return t.RotateRight()
		}
	} else if t.key < key {
		t.right = t.right.Insert(key, prio)
		if t.priority < t.right.priority {
			return t.RotateLeft()
		}
	}
	return t
}

func (t *TreapNode) RotateLeft() *TreapNode {
	if t.right == nil {
		return t
	}
	nt := t.right
	ol := nt.left
	nt.left = t
	t.right = ol
	return nt
}

func (t *TreapNode) RotateRight() *TreapNode {
	if t.left == nil {
		return t
	}
	nt := t.left
	or := nt.right
	nt.right = t
	t.left = or
	return nt
}

func (t *TreapNode) Find(key int) bool {
	if t == nil {
		return false
	}

	if t.key == key {
		return true
	} else if key < t.key {
		return t.left.Find(key)
	}
	return t.right.Find(key)
}

func (t *TreapNode) Delete(key int) *TreapNode {
	if t == nil {
		return nil
	}
	if t.key == key {
		if t.left == nil && t.right == nil {
			return nil
		}
		if t.left == nil {
			return t.RotateLeft().Delete(key)
		}
		if t.right == nil {
			return t.RotateRight().Delete(key)
		}
		if t.left.priority < t.right.priority {
			return t.RotateLeft().Delete(key)
		} else {
			return t.RotateRight().Delete(key)
		}
	} else if key < t.key {
		t.left = t.left.Delete(key)
	} else if t.key < key {
		t.right = t.right.Delete(key)
	}
	return t
}

func (t *TreapNode) KeysPreorder() []int {
	if t == nil {
		return nil
	}
	res := append([]int{t.key}, t.left.KeysPreorder()...)
	res = append(res, t.right.KeysPreorder()...)
	return res
}

func (t *TreapNode) KeysInorder() []int {
	if t == nil {
		return nil
	}
	res := t.left.KeysInorder()
	res = append(res, t.key)
	res = append(res, t.right.KeysInorder()...)
	return res
}

func (t *TreapNode) String() string {
	if t == nil {
		return "(nil)"
	}
	return fmt.Sprintf("%d/%d", t.key, t.priority)
}



Measured memory_bytes: 40248