1. Harus Mencakup semua Materi Object Oriented Programming
   1. Class (5 point)
   2. Object (5 point)
   3. Polymorphism (15 point)
   4. Inheritance  (15 Point)
   5. Encapsulation dan Hak Akses (10 Point)
   6. Exception Handling (10 Point)
   7. Multithreading (20 Point)
   8. Abstract dan Interface (10 Point)
   9. Package (10 Point)

1. Diperbolehkan Berbasis GUI (Grapichal user Interface) dengan catatan harus murni coding.
2. Non-GUI tidak masalah asal mencakup semua Materi.
3. Tidak ada perbedaan nilai baik GUI/Non-GUI semua sama, asal mencakup semua materi OOP.
4. Silahkan Menggunakan Notepad++, JCreator, Netbeans, Eclipse dll asalkan murni coding
5. dilarang copy paste murni dari buku / source online,
   nilai saya (-30 point) jika ketahuan mengambil dari resource yang sudah ada baik di Buku/Internet.
6. Penilaian berdasarkan Point diatas.
7. Tidak ada toleransi Judul atau Program yang sama, jika ada yang sama secepatnya diganti .
   atau silahkan terima jika nilai juga saya BAGI RATA dengan Kelompok yang menggunakan program / judul yang sama.
8. Demo semua Mahasiswa, Sebelum Tanggal 16 januari 2012, nanti saya jadwal
9. Konsep (ingat konsep bukan program) maksimal dikumpulkan By Email (gadzata@gmail.com) maksimal Tanggal 30 Desember 2011.
   Setiap email yang masuk , maksimal 2 hari setelah pengiriman akan saya konfirmasi baik di email balasan atau di blog “menghindari jika alasan tidak terkirim“.
   Subject email : Konfirmasi Konsep UAS PBO Kelas B [Kelompok ?]
10. Tidak ada Toleransi, jika tidak mengumpulkan konsep sesuai tanggal, Demo tidak diterima.

Aplikasi Awal

pesan

Kirimkan sourcecode dalam dari aplikasi anda ke email saya gadzata@gmail.com.  Setiap individu tidak boleh ada yang sama jika ada yang sama maka nilai = 0. Jangan lupa cantumkan nama dan NRP anda

Asif and Nafisa are very interested in solving puzzles.They always try to give one another puzzles to see who is the best.So ,as usual, one day, Nafisa gave Asif a matrix.

The matrix is as follows

A B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C ......
B C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D ......
C D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E ......
D E F G H I J K L M N O P Q R S T U V W X Y Z A B C D E F ......
................................................................

Assume that the matrix is very huge (both row and column wise). Nafisa describes a special sequence as a sequence  whose first term is ‘A’ [element at (0,0)], second term is ‘B’ [element at  (0,1)], third term is ‘B’ [element at (1,0)], fourth term is ‘C’ [element at (2,0)]. Now,she asks Asif to find the nth term of this special sequence. Help Asif To solve the problem.

Input

There will be multiple test cases with number N(1<=N<=1000000) per line.

Output

A character ['A'-'Z'] per line for each number N representing the Nth number in the special sequence.

Example

Input:
3
6
10
Output:
B
C
D

Problem Requirement

Runtime Limit : 1 seconds
Memory Limit : 50000 bytes

Alchemy is a discipline that is believed to span at least 2500 years of human history. It is most known for its intention of transforming matter, typically trying to come up with a recipe to make gold based on much less valued metals, aided by some non-metal components.

Most scientists and scholars think that alchemy has failed. They surely do not know that a particular alchemist named Albert Ainstain, managed to create gold from a simple combination of ordinary iron (much more common and cheap than gold) and some good-old-fashioned water. However, the combination must have the exact proportion of grams of iron and centiliters of water to work, otherwise the alchemist would end up with useless rusty iron.

Many alchemists and bussinessman had tried to recreate Albert Ainstain’s findings to achieve recognition, fame, prestige or economical welfare, but none of them have suceeded. Since you know very little about chemistry, alchemy and ancient practices, you believe that your chances for success in this task are bounded to using a computer in your benefit.

Therefore, you decide to create a program that automatically tests a given combination of iron and water, and informs whether that combination has the correct proportion to produce gold. Of course, once you find the right proportion, you can double both amounts and get double the gold, cut both in half and get half the gold, or multiply both by any other real number to obtain the amount of gold you want.

Your task is then, given the number of grams of iron and the number of centiliters of water, say whether the proportion between both components is the right one.

Input

The input contains several test cases, each one described in a single line. The line contains two integers I and W separated by a single space, representing grams of iron and centiliters of water, respectively (1 ≤ I, W ≤ 10⁶ ). The last line of the input contains the number −1 twice separated by a single space and should not be processed as a test case.

Output

For each test case output a single line containing an uppercase “Y” if the combination produces gold, or an uppercase “N” otherwise.

Example

Input:
1000 37
999 37
10000 370
10001 370
-1 -1

Output:
Y
N
Y
N

Problem Requirement

Runtime Limit : 1 seconds
Memory Limit : 10000 bytes

Yesterday was Sam’s birthday. The most interesting gift was definitely the chessboard. Sam quickly learned the rules of chess and defeated his father, all his friends, his little sister, and now no one wants to play with him any more.

So he decided to play with another birthday gift – a Book of Math Problems for Young Mathematicians. He opened the book somewhere in the middle and read the following problem: “How many knights can be placed on a chessboard without threatening each other?” After a while he realized that this was trivial and moved on to the next problem: “How many bishops can be placed on a chessboard without threatening each other?”. Sam is in trouble here. He is not able to solve this problem and needs your help.

Sam’s chessboard has size N x N. A bishop can move to any distance in any of the four diagonal directions. A bishop threatens another bishop if it can move to the other bishop’s position. Your task is to compute the maximum number of bishops that can be placed on a chessboard in such a way that no two bishops threaten each other.

Input

The input file consists of several lines. The line number i contains a single number N representing the size of the i-th chessboard. (N <= 10^5)

Output

The output file should contain the same number of lines as the input file. The i-th line should contain one number – the maximum number of bishops that can be placed on i-th chessboard without threatening each other.

Example

Input:
2
3

Output:
2
4

Problem Requirement

Runtime Limit : 0.5 seconds
Memory Limit : 50000 bytes