You are given an integer sequence of length N: A=(A 1 ​ ,A 2 ​ ,⋯,A N ​ ).

Find the number of pairs of integers (i,j) (1≤i<j≤N) such that calculation of A i ​ +A j ​ by column addition does not involve carrying.