AKOJ正在加载中...

3034: Triangular numbers

金币值:2 定数:1 时间限制:2.000 s 内存限制:256 M
正确:0 提交:0 正确率:0.00% 命题人:
点赞量:0 收藏量:0 题目类型:程序

题目描述

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

A triangular number is the number of dots in an equilateral triangle uniformly filled with dots. For example, three dots can be arranged in a triangle; thus three is a triangular number. The n-th triangular number is the number of dots in a triangle with n dots on a side. . You can learn more about these numbers from Wikipedia (http://en.wikipedia.org/wiki/Triangular_number).

Your task is to find out if a given integer is a triangular number.

Input

The first line contains the single number n (1≤n≤500) − the given integer.

Output

If the given integer is a triangular number output YES, otherwise output NO.

Examples
Input
1
Output
YES
Input
2
Output
NO
Input
3
Output
YES