// Arup Guha
// 4/27/2019
// Solution to 2017 AP CS A Free Response Question #1: Digits

import java.util.*;

public class Digits {
	
	private ArrayList<Integer> digitList;
	
	public Digits(int num) {
		
		digitList = new ArrayList<Integer>();
		
		// So the AP people probably want you to do something silly like new Integer(num%10)
		// but Java does this for you...
		while (num > 0) {
			digitList.add(0, num%10);
			num /= 10;
		}
		
		// 0 is a special case here...
		if (digitList.size() == 0)
			digitList.add(0, 0);
	}
	
	public boolean isStrictlyIncreasing() {
		
		// Just see if there is any consecutive pair that isn't strictly increasing...
		for (int i=0; i<digitList.size()-1; i++)
			if (digitList.get(i) >= digitList.get(i+1))
				return false;
			
		// If we get here, we're good.
		return true;
	}
	
	// For testing.
	public String toString() {
		String res = "";
		for (int i=0; i<digitList.size(); i++)
			res = res + digitList.get(i);
		return res;
	}
	
	public static void main(String[] args) {
		
		Digits mynum = new Digits(123456789);
		Digits yournum = new Digits(15704);
		Digits zero = new Digits(0);
		System.out.println(mynum+" "+yournum+" "+zero);
		System.out.println(mynum.isStrictlyIncreasing()+" "+yournum.isStrictlyIncreasing()+" "+zero.isStrictlyIncreasing());
		
		System.out.println(new Digits(7).isStrictlyIncreasing());
		System.out.println(new Digits(1356).isStrictlyIncreasing());
		System.out.println(new Digits(1336).isStrictlyIncreasing());
		System.out.println(new Digits(1536).isStrictlyIncreasing());
		System.out.println(new Digits(65310).isStrictlyIncreasing());
		
		
	}


}