Done with her new problems, Wendy takes a break from math.  Still without any fresh reading material, she feels a bit antsy.  She starts to feel annoyed that Michael's loose papers clutter the family van.  Several of them are ripped, and bits of paper litter the floor.  Tired of trying to get Michael to clean up after himself, Wendy spends a couple of minutes putting Michael's loose papers in the trash.  "That seems fair to me," confirms Hannah encouragingly.

While collecting Michael's scraps, Wendy comes across a corner of a piece of paper with part of a math problem written on it.  There is a monic polynomial of degree $n$, with real coefficients.  The first two terms after $x^n$ are $a_{n-1}x^{n-1}$ and $a_{n-2}x^{n-2}$, but the rest of the polynomial is cut off where Michael's page is ripped.  Wendy barely makes out a little of Michael's scribbling, showing that $a_{n-1}=-a_{n-2}$.  Wendy deciphers the goal of the problem, which is to find the sum of the squares of the roots of the polynomial.  Wendy knows neither the value of $n$, nor the value of $a_{n-1}$, but still she finds a [greatest] lower bound for the answer to the problem.  Find the absolute value of that lower bound.
1. **Identify the polynomial and its properties:**
   We are given a monic polynomial of degree \( n \) with real coefficients. The polynomial can be written as:
   \[
   P(x) = x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + \cdots + a_1x + a_0
   \]
   We are also given that \( a_{n-1} = -a_{n-2} \).

2. **Use Vieta's formulas:**
   Vieta's formulas relate the coefficients of the polynomial to sums and products of its roots. For a polynomial \( P(x) = x^n + a_{n-1}x^{n-1} + a_{n-2}x^{n-2} + \cdots + a_1x + a_0 \) with roots \( r_1, r_2, \ldots, r_n \), Vieta's formulas tell us:
   \[
   r_1 + r_2 + \cdots + r_n = -a_{n-1}
   \]
   \[
   r_1r_2 + r_1r_3 + \cdots + r_{n-1}r_n = a_{n-2}
   \]

3. **Sum of the squares of the roots:**
   We need to find the sum of the squares of the roots, which can be expressed as:
   \[
   r_1^2 + r_2^2 + \cdots + r_n^2
   \]
   Using the identity for the sum of squares, we have:
   \[
   r_1^2 + r_2^2 + \cdots + r_n^2 = (r_1 + r_2 + \cdots + r_n)^2 - 2 \sum_{1 \leq i < j \leq n} r_i r_j
   \]
   Substituting Vieta's formulas, we get:
   \[
   r_1^2 + r_2^2 + \cdots + r_n^2 = (-a_{n-1})^2 - 2a_{n-2}
   \]

4. **Substitute \( a_{n-1} = -a_{n-2} \):**
   Given \( a_{n-1} = -a_{n-2} \), we substitute this into the equation:
   \[
   r_1^2 + r_2^2 + \cdots + r_n^2 = (-(-a_{n-2}))^2 - 2a_{n-2}
   \]
   \[
   r_1^2 + r_2^2 + \cdots + r_n^2 = (a_{n-2})^2 - 2a_{n-2}
   \]

5. **Find the greatest lower bound:**
   To find the greatest lower bound of \( (a_{n-2})^2 - 2a_{n-2} \), we consider the function \( f(x) = x^2 - 2x \). The minimum value of this quadratic function occurs at its vertex. The vertex of \( f(x) = x^2 - 2x \) is at:
   \[
   x = -\frac{b}{2a} = \frac{2}{2 \cdot 1} = 1
   \]
   Substituting \( x = 1 \) into the function:
   \[
   f(1) = 1^2 - 2 \cdot 1 = 1 - 2 = -1
   \]
   Therefore, the greatest lower bound of \( (a_{n-2})^2 - 2a_{n-2} \) is \( -1 \).

The final answer is \( \boxed{1} \)