import java.io.InputStream;
import java.io.PrintWriter;
import java.lang.reflect.Array;
import java.math.BigDecimal;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Map.Entry;
import java.util.PriorityQueue;
import java.util.Scanner;
import java.util.Set;
import java.util.Stack;
import java.util.TreeMap;
import java.util.TreeSet;

import static java.util.Comparator.*;

public class Main {
    public static void main(String[] args) {
        PrintWriter out = new PrintWriter(System.out);
        Solver solver = new Solver(System.in, out);
        solver.solve();
        out.close();
    }
}
class Solver {
	Scanner sc;
	PrintWriter out;
    public Solver(InputStream in, PrintWriter out) {
    	sc = new Scanner(in);
    	this.out = out;
    }
    // ==================================================================
    public void solve() {
    	long N = Long.parseLong(sc.next());
    	long ng = 0, ok = 2000000000L;
    	long md, wk;
    	while(ng <= ok) {
    		md = (ng + ok) / 2;
    		wk = (md + 1) * md / 2;
//    		out.println(" ng = " + ng + "  ok = " + ok 
//    					+ "  md = " + md + "  wk = " + wk);
    		if(wk == N) {
    			out.println("YES");
    			out.println(md);
    			return;
    		} else if(wk < N) {
    			if(ng == md)	break;
    			ng = md;
    		} else {
    			if(ok == md)	break;
    			ok = md;
    		}
    	}
    	out.println("NO");
    }
}