CF288D Polo the Penguin and Trees

Little penguin Polo has got a tree — a non-directed connected acyclic graph, containing $ n $ nodes and $ n-1 $ edges. We will consider the tree nodes numbered by integers from 1 to $ n $ . Today Polo wonders, how to find the number of pairs of paths that don't have common nodes. More formally, he should find the number of groups of four integers $ a,b,c $ and $ d $ such that: - $ 1

The first line contains integer $ n $ $ (1

In a single line print a single integer — the answer to the problem. Please do not use the %lld specificator to read or write 64-bit numbers in С++. It is recommended to use the cin, cout streams or the %I64d specificator.