public int furthest(int N, int badStep) {
		int current = 0;
		for (int i = 1; i <= N; i++) {
			if (current + i == badStep) {
				current--;//decrement first step
			}
			current += i;
		}
		return current;
	}