package main import ( "bufio" "fmt" "math/big" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() 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 } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } 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 } func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) // this template is new version. // use getI(), getS(), getInts(), getF() N := getI() x := big.NewInt(int64(N)) x = x.Mul(x, big.NewInt(8)) x = x.Add(x, big.NewInt(1)) y := big.NewInt(0) y = y.Add(y, x) y = y.Sqrt(x) z := big.NewInt(0) z = z.Add(z, y) z = z.Mul(z, z) // out(x, y, z) // out(z.Cmp(x)) if z.Cmp(x) == 0 { Y := y.Int64() if (Y-1)%2 == 0 { out("YES") out((Y - 1) / 2) return } } out("NO") // x := 8*N + 1 // y := int(math.Sqrt(float64(x))) // out(x, y) // if Y*Y == X && (Y-1)%2 == 0 { // out("YES") // out((Y - 1) / 2) // return // } // out("NO") }