I have a xml document like this

&lt;Products&gt;
  &lt;Product Name="Mobile Device" Code="10000000000000000006"&gt;
    &lt;Providers&gt;
        &lt;Provider Name="VODA" Code="VODA"&gt;
            &lt;Menus&gt;
                &lt;Menu  Name="Home" Url="TopModelsNew.aspx" DisplayOrder="1" NewWindow="0"/&gt;
                &lt;Menu  Name="Top Queries" Url="TopIssues.aspx" DisplayOrder="2" NewWindow="0"/&gt;
                &lt;Menu  Name="Error Codes" Url="PCErrors.aspx" DisplayOrder="3" NewWindow="0"/&gt;
            &lt;/Menus&gt;
        &lt;/Provider&gt;
    &lt;/Providers&gt;
&lt;/Product&gt;




I want to find all the menu where Product Code="10000000000000000006" and Provider Code="VODA" in a list.
The result should be like



  Name    Url            DisaplayOrder 
  Home    TopModels      0


I was trying linq to xml as follows

 XDocument xdoc = XDocument.Load(Server.MapPath("~/App_Data/LeftMenu.xml"));
        var products = from product in xdoc.Descendants("Product") where
        new{
                 .....    
            };


I am not able to find how to get the list.


Question: Paradoxes without self-reference?
Answer: It is well known that the natural numbers have the property that if we have some non-empty set $A\subseteq\mathbb{N}$, then $A$ has a minimal element. Now let
$$A = \{n\in\mathbb{N}|\,n\mathrm{\ can't\ be\ expressed\ with\ less\ than\ }100\mathrm{\ characters}\}$$
Let $a\in A$ be the smallest element in $A$. Then we can express $a$ as "$a$ is the smallest number that can't be expressed with less than $100$ characters". But this is an expression for $a$ containing less than $100$ characters, which would be a contradiction. We deduce that $A=\emptyset$. Thus every natural number can be expressed with less than $100$ characters. But there is only a limited number $n$ of characters, thus there are at most $n^{100}$ natural numbers.

This paradox is known with the name of Richard's paradox.