##  Program to find vertices greater than degree 2 and total degree of graph

from time import clock
import sys

def degree_of_undirected_graph():

      
          
          global memUsed
          n=InFile.readline()
          vertex=InFile.readline().split(" ")
          
          ansvertex=[]
          Totaldegree=0
          for i in range(0,len(vertex)):
               num=InFile.readline().split(" ")
               c=num.count('1')+ num.count('1\n')
               
               if (c > int(n)):
                    
                    ansvertex.append(num[0])                         
               Totaldegree+=c              

          OutFile.write("\n VERTICES GREATER THAN DEGREE 2 : " + str(ansvertex))
          OutFile.write("\n Total degree of graph is : "+ str(Totaldegree))
          memUsed = sys.getsizeof(InFile) + sys.getsizeof(OutFile)+ sys.getsizeof(vertex)+ sys.getsizeof(Totaldegree)+ sys.getsizeof(ansvertex)+ sys.getsizeof(num)+ sys.getsizeof(c)
          
          
start=clock()
memUsed=0
InFile=open('in19_5.txt','r')
OutFile=open('out_15_19_5.txt','w') 
degree_of_undirected_graph()
  



         
OutFile.write("\n Total Excution Time : "+str(clock()-start))                    
          

OutFile.write("\n Memory used : "+str(memUsed)+" Bytes")        


InFile.close()
OutFile.close()

print " Output File  is Generated"