跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F1863. Triangular numbers

  • ID: 1869
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:入门
  • 上传者:
  • 枚举
  • 数学
  • 算法思想
  • 入门
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Triangular numbers

题目描述

A. Triangular numbers
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

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1437 题。保留原作者与原赛事署名。