A group of N Internet Service Provider companies (ISPs) use a private communication channel that has a maximum capacity of \textbf{C} traffic units per second. Each company transfers \textbf{T} traffic units per second through the channel and gets a profit that is directly proportional to the factor \textbf{T}(\textbf{C} - \textbf{T N}). The problem is to compute \textbf{T_optim}, the smallest value of \textbf{T} that maximizes the total profit the \textbf{N} ISPs can get from using the channel. Notice that \textbf{N}, \textbf{C}, \textbf{T}, and \textbf{T_optim} are integer numbers. \InputFile Write a program that reads sets of data from an input text file. Each data set corresponds to an instance of the problem above and contains two integral numbers - \textbf{N} and \textbf{C} - with values in the range from \textbf{0} to \textbf{10^9}. The input data are separated by white spaces, are correct, and terminate with an end of file. \OutputFile For each data set the program computes the value of \textbf{T_optim} according to the problem instance that corresponds to the data set. The result is printed on the standard output from the beginning of a line. There must be no empty lines on the output. An example of input/output is shown below.