The pseudocode of a function \( fun() \) is given below:
\[
\text{fun(int A[0, \ldots, n-1])} \{
\]
\[
\text{for } i = 0 \text{ to } n-2
\]
\[
\text{for } j = 0 \text{ to } n - i - 2
\]
\[
\text{if } (A[j] > A[j+1]) \text{ then swap } A[j] \text{ and } A[j+1]
\]
\[
\}
\]
Let \( A[0, \ldots, 29] \) be an array storing 30 distinct integers in descending order.
The number of swap operations that will be performed, if the function \( fun() \) is called with \( A[0, \ldots, 29] \) as argument, is ______ (Answer in integer).