public Stack binario(int n)	
	{	
		Stack v=new Stack();	
		int residuo=0;
		for(int i=0;i<100;i++)
		{
			residuo= n%2;					
			n=n/2;	
			v.push(new Integer(residuo));
			if(n==1)
			{				
				v.push(new Integer(n));
				break;
			}		
		}		
		System.out.println("			pila: " +v);
		return v;
	}	
	
	public Stack inversa_vector(Stack v)
	{
		Stack a=new Stack();		
		int tam=v.size();	
		for(int i=0;i<tam;i++)			
		{
			a.push(v.pop());											
		}
		System.out.println("			pila inversa: " +a);
		return a;
	}