Classify the Access a[n]

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

An array $a$ contains exactly $n$ elements. With C's zero-based indexing, the valid elements are

Consider the access a[n]. Classify this access according to C array bounds. Do not attempt to predict a concrete value from memory outside the array.

Input

One line contains the integer $n$.

Output

Print exactly UNDEFINED_BEHAVIOR.

Subtasks

Subtask 1 (100 points): $1\le n\le10^9$.

Examples

Input

5

Output

UNDEFINED_BEHAVIOR

Explanation

For $n=5$, valid indices are $0,1,2,3,4$. Index $5=n$ is immediately past the last element. Reading a[5] is an out-of-bounds array access and has undefined behavior, so no numeric value may be predicted for it.