package main

import (
	"bufio"
	"fmt"
	"os"
	"sort"
	"strconv"
)

func out(x ...interface{}) {
	fmt.Println(x...)
}

var sc = bufio.NewScanner(os.Stdin)

func getInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func getInts(N int) []int {
	ret := make([]int, N)
	for i := 0; i < N; i++ {
		ret[i] = getInt()
	}
	return ret
}

func getString() string {
	sc.Scan()
	return sc.Text()
}

// min, max, asub, absなど基本関数
func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

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

func asub(a, b int) int {
	if a > b {
		return a - b
	}
	return b - a
}

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

func lowerBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] >= x
	})
	return idx
}

func upperBound(a []int, x int) int {
	idx := sort.Search(len(a), func(i int) bool {
		return a[i] > x
	})
	return idx
}

// N :
var N int

// L, S :
var L, S []int
var vis, done []int

func dfs(cur, tar int) int {
	if done[S[cur]] == 1 {
		return -1
	}
	if cur == tar {
		return tar
	}
	if vis[S[cur]] == 1 {
		return -1
	}
	vis[cur] = 1
	x := dfs(S[cur], tar)

	if x < 0 {
		return -1
	}
	if L[cur] < L[x] {
		return cur
	}
	return x
}

func main() {
	sc.Split(bufio.ScanWords)

	N = getInt()
	L = make([]int, N)
	S = make([]int, N)
	for i := 0; i < N; i++ {
		L[i], S[i] = getInt()*2, getInt()-1
	}

	ret := 0
	done = make([]int, N)
	for i := 0; i < N; i++ {
		if done[i] == 0 {
			vis = make([]int, N)
			x := dfs(S[i], i)
			if x >= 0 {
				ret += L[x]
				done[x] = 1
			}
		}
	}
	for i := 0; i < N; i++ {
		for j := 0; j < N; j++ {
			if done[S[j]] == 1 && done[j] == 0 {
				done[j] = 1
				ret += L[j] / 2
			}
		}
	}

	out(float64(ret) * 0.5)
}