The tree of blobs of an arbitrary species network N is the tree T that displays only the tree edges in the underlying network relating taxa. Any reticulate substructures of N are collapsed to a single node in T. We show that the tree of blobs for a model network N is identifiable from quartet concordance factors under the Network Multispecies Coalescent model, and give an algorithm, TINNiK, for its consistent inference from multilocus datasets. TINNiK is implemented in the R package MSCquartets 2.0. We give examples of applying TINNiK to simulated and empirical datasets, emphasizing the role that TINNiK might play in quickly identifying locations in T where evolution may not have been tree-like. This work is joint with H. Banos, J. Mitchell, and J. Rhodes.