Given an integer $n\geq 2$. Call a positive integer ${T}$ Pingsheng Number, if there exists pairwise different non empty subsets $A_1,A_2,\cdots ,A_m$ $(m\geq 3)$ of set $S=\{1,2,\cdots ,n\},$ satisfying $T=\sum\limits_{i=1}^m|A_i|,$ and for $\forall p,q,r\in\{1,2,\cdots ,m\},p\neq q,q\neq r,r\neq p,$ we have $A_p\cap(A_q\triangle A_r)=\varnothing$ or $A_p\subseteq (A_q\triangle A_r).$ Find the max Pingsheng Number.