You have a string of decimal digits $*s*$. Let's define $*b*_{*ij*} = *s*_{*i*}·*s*_{*j*}$. Find in matrix $*b*$ the number of such rectangles that the sum $*b*_{*ij*}$ for all cells $(*i*, *j*)$ that are the elements of the rectangle equals $*a*$ in each rectangle.
A rectangle in a matrix is a group of four integers $(*x*, *y*, *z*, *t*)$ $(*x* ≤ *y*, *z* ≤ *t*)$. The elements of the rectangle are all cells $(*i*, *j*)$ such that $*x* ≤ *i* ≤ *y*, *z* ≤ *j* ≤ *t*$.
Input
The first line contains integer $*a*$ ($0 ≤ *a* ≤ 10^{9}$), the second line contains a string of decimal integers $*s*$ ($1 ≤ |*s*| ≤ 4000$).
Output
Print a single integer — the answer to a problem.
Please, do not write the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.
样例
10
12345
6
16
439873893693495623498263984765
40
题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。